Syllabus
Formal models in game theory
Auctions, Myerson's Lemma
Price of anarchy
Nash equilibrium, Nash's Existence Theorem
Finding equilibria, complexity class PPAD
Correlated equilibiria and other variants
Minimax Theorem
Annotation
An introduction to algorithmic game theory, a relatively new field whose objective is to study formal models of strategic environments and to design effective algorithms for them. This introductory course covers basic concepts and methods that are illustrated with several practical applications.
To successfully pass the course, it is recommended to know basics from complexity theory.