Course on Algorithmic Game Theory, March 2013 - July 2013

by Uri Feige


Lecture notes.

Lectures 6 and 7, 2 and 9 of May 2013: Minimizing regret in repeated play of games.


Handouts (homework) for course.

Handout 1, 21 March 2013: Solution concepts.
Handout 2, 4 April 2013: Stable matching.
Handout 3, 11 April 2013: Linear programming, 0-sum games.
Handout 4, 18 April 2013: Mixed Nash.
Handout 5, 25 April 2013: Sperner's lemma, the Lemke Howson algorithm, PPAD.
Handout 6 and 7, 2 and 9 of May 2013: Sublinear regret.
Handout 8 - 10, 23 and 30 of May, 6 of June 2013: Price of anarchy, selfish routing, mechanism design, VCG.
Handout 11 and 12, 20 and 27 of June 2013: Submodular welfare.

If you find errors in lecture notes or handouts, please let me know.


Project, handed out on 23 of May 2013: A competition among agents. Some technical instructions for the project. Python files: StudentName , Definitions , Check .


Take home exam, 4th of July 2013: hand in by August 1, 2013.