The aim of the course is to make the students understand the central notions, methods, and results of the field of algorithmic game theory and to enable them to apply the methods to new problems in this area.
Nash equilibrium and general equilibrium. Social choice theory. Mechanism design. Sponsored search. Combinatorial auctions. PPAD-completeness. Current research topics in the area.
Vorlesungstermine: Donnerstag 9:00-11:00 Die Vorlesung findet an der Universität Wien statt. Weitere Informationen siehe das Vorlesungsvereichnis der Universität Wien.
Nicht erforderlich
Good background in algorithms is required, but no specific knowledge of the area.