In the course, we discuss methods and concepts from algorithmic game theory. The course counts as "Algorithmic Discrete Mathematics III" (ADM III). It is helpful, but not necessary to have taken the ADM I and ADM II courses of last semesters. The topics covered in this course include:
- Nash equilibria
- normal form games
- computation of Nash equilibria
- complexity of computing Nash equilibria
- extensive form games
- congestion games
- computation of equilibria in congestion games
- efficiency of equilibria in congestion games
- computational social choice
- mechanism design
- auctions
- Trainer/in: Max Klimm