These are my (unofficial) lecture notes for the lecture Algorithmic Game Theory held by Prof. F. Brandt at the Technical University Munich in the summer semester 2021.
Topics covered include:
- preference relations and lotteries
- normal form games
- maximin strategies, Nash equilibria and many variations
- cooperative game theory
- stable matchings (in the sense of the marriage problem)
- zero-sum games
- succinct games and commitments
- extensive-form games