| Lecture no. | Topics | Slides (PDF) | Reading - Comments |
|---|---|---|---|
Lecture 1 (9/25) |
Administrivia, Introduction |
L1 |
|
Lecture 2 (9/30), (10/02) |
Definitions and Existence of Nash Equilibrium |
L2 |
|
Lecture 3 (10/07) |
LP duality and zero-sum games |
L3 |
|
Lecture 4 (10/09) |
Algorithms for computing Nash in two-player games |
L4 |
|
Lecture 5 (10/14) |
Potential and Congestion Games |
L5 |
|
Lecture 6 (10/16), (10/21) |
No-regret and a proof of minimax Theorem |
L6 |
|
Lecture 7 (10/23), (10/28), (10/30) |
Complexity Classes and AGT, PLS and PPAD |
L7 (part a) L7 (part b) |
|
Lecture 8 (11/04) |
Other equilibrium notions |
L8 |
|
Lecture 9 (11/06) |
Intro to Mechanism Design |
L9 |
|
Lecture 10 (11/13), (11/18) |
Monotone allocations and Myerson’s lemma |
L10 |
|
Lecture 11 (11/18), (11/20) |
Virtual valuations and reserve prices |
L11 |
|
Lecture 12 (11/20) |
Price of Anarchy |
L12 |