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.
Course dates: Thursday 9:00-11:00. The course takes place at the University of Vienna. For more information see the Lecture directory of the University of Vienna.
Not necessary
Good background in algorithms is required, but no specific knowledge of the area.