Algorithmic Game Theory (ADM III)

Winter 2025/26
Lecturer: Sven Jäger
More information and materials: ISIS course page

Content

In this course, we study game-theoretic solution concepts such as equilibria in varios types of games from an algorithmic perspective, in particular,

• Games and their equilibria
• Computation of equilibria
• Games in extensive form
• Congestion games
• Cake cutting
• Computational social choice
• Mechanism design and auctins

Prerequisites

Succesfull completion of the lectures "Introduction to linear and combinatoral optimization (ADM I)" and "Discrete optimization (ADM II)" are helpful but not mandatory.