185.345 Algorithmic Game Theory
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2011S, VU, 2.0h, 3.0EC

Properties

  • Semester hours: 2.0
  • Credits: 3.0
  • Type: VU Lecture and Exercise

Aim of course

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.

Subject of course

Nash equilibrium and general equilibrium. Social choice theory. Mechanism design. Sponsored search. Combinatorial auctions. PPAD-completeness. Current research topics in the area.

Additional information

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.

Lecturers

  • Henzinger, Monika

Institute

Course registration

Not necessary

Curricula

Study CodeObligationSemesterPrecon.Info
066 931 Computational Intelligence Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 938 Computer Engineering Mandatory elective

Literature

No lecture notes are available.

Previous knowledge

Good background in algorithms is required, but no specific knowledge of the area.

Miscellaneous

Language

English