Algorithmic Game Theory (ADM III)

Winter 2024/25
Lecturer: Max Klimm
More information and materials: ISIS course page

Content

This lecture is the sequel to the lectures "Introduction to linear and combinatorial optimization (ADM I)" and "Discrete optimization (ADM II)". We study game theoretic solution concepts such as equilibria in varios types of games, in particular,

• Games and their equilibria
• Computation of equilibria
• Games in extensive form
• Congestion games
• Efficiency of equilibria
• 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.