CS 295 - Introduction to Algorithmic Game Theory
Below we will be posting slides and lecture notes for the class.
| Lecture no. | Topics | Reading |
|---|---|---|
| Lecture 1 | Administrivia, Introduction | |
| Lecture 2 | Definitions and Existence of NE | Lecture notes |
| Lecture 3 | LP Duality and zero-sum games | Lecture notes |
| Lecture 4 | No-regret and a proof of minimax Theorem | Lecture notes |
| Lecture 5 | Algorithms for computing Nash in two-player games | Lecture notes |
| Lecture 6 | Potential and Congestion Games | |
| Lecture 7 | Price of Anarchy | Lecture notes |
| Lecture 8 | Complexity Classes and AGT | Lecture notes |
| Lecture 9 | PLS and PPAD reductions | Lecture notes |
| Lecture 10 | Other notions of equilibria | Lecture notes |
| Lecture 11 | Intro to Mechanism Design | Lecture notes |
| Lecture 12 | Monotone allocations and Myerson’s lemma | Lecture notes |
| Lecture 13 | Virtual valuations and reserve prices | Lecture notes |
| Lecture 14 | Arrow’s and Gibbard-Satterthwaite theorem | Lecture notes |
| Lecture 15 | Randomized Voting | |
| Lecture 16 | Introduction to Markets | |
| Lecture 17 | More on Markets | |
| Lectures 18-20 | Paper Presentations |