CS 295 - Intro to Algorithmic Game Theory - Fall, 2022
Course staff
- Instructor:
- Ioannis Panageas
- Email: ipanagea at ics dot uci dot edu.
- Office hours: By appointment, DBH 4072
- Class announcements will be made on canvas. Please check there frequently.
- Lectures: 05:00-06:20pm TuTh PCB 1200
- Piazza:
- Questions of general interest about the course material and the homework, should be posted on piazza.
- The syllabus, including grading policy, schedule of hws and academic honor code can be found here.
- Required textbook. [AGT] Algorithmic Game Theory, by eds Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay V. Vazirani.
Class announcements
Class meetings
Syllabus
Textbook
Schedule of classes and slides
| Lecture no. | Topics | Notes |
|---|---|---|
| Lecture 1 (9/22) | Administrivia, Introduction | |
| Lecture 2 (9/27) | Definitions and Existence of NE | Lecture notes |
| Lecture 3 (9/29) | LP Duality and zero-sum games | Lecture notes |
| Lecture 4 (10/04) | No-regret and a proof of minimax Theorem | Lecture notes |
| Lecture 5 (10/06) | Algorithms for computing Nash in two-player games | Lecture notes |
| Lecture 6 (10/11) | Potential and Congestion Games | Lecture notes |
| Lecture 7 (10/13) | Price of Anarchy | Lecture notes |
| Lecture 8 (10/18) | Complexity Classes and AGT | Lecture notes |
| Lecture 9 (10/20), (10/25) | PLS and PPAD reductions | Lecture notes |
| Lecture 10 (10/27) | Other notions of equilibria | Lecture notes |
| Lecture 11 (11/1) | Intro to Mechanism Design | Lecture notes |
| Lecture 12 (11/3), (11/8) | Monotone allocations and Myerson’s lemma | Lecture notes |
| Lecture 13 (11/10) | Virtual valuations and reserve prices | |
| Lecture 14 (11/15) | Arrow’s and Gibbard-Satterthwaite theorem | |
| Lecture 15 (11/17) | Randomized Voting | |
| Lecture 16 (11/22) | Single and multi-agent Reinforcement Learning |