| Lecture no. | Topics | Slides (PDF) | Reading - Comments |
|---|---|---|---|
Lecture 1 (9/26) |
Administrivia, Introduction |
L1 |
|
Lecture 2 (10/01), (10/03) |
Definitions and Existence of Nash Equilibrium |
L2 |
|
Lecture 3 (10/08) |
LP duality and zero-sum games |
L3 |
|
Lecture 4 (10/10) |
Algorithms for computing Nash in two-player games |
L4 |
|
Lecture 5 (10/15) |
Potential and Congestion Games |
L5 |
|
Lecture 6 (10/16), (10/22) |
No-regret and a proof of minimax Theorem |
L6 |
|
Lecture 7 (10/24), (10/31) |
Complexity Classes and AGT, PLS and PPAD |
L7 (part a) L7 (part b) |
|
Lecture 8 (11/05) |
Other equilibrium notions |
L8 |
|
Lecture 9 (11/07) |
Intro to Mechanism Design |
L9 |
|
Lecture 10 (11/12) |
Monotone allocations and Myerson’s lemma |
L10 |
|
Lecture 11 (11/14) |
Virtual valuations and reserve prices |
L11 |
|
Lecture 12 (11/19) |
Markov Games |
L12 |