CS 280 - Algorithmic Game Theory - Fall, 2023
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: 03:30-04:50pm 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/28) | Administrivia, Introduction | |
Lecture 2 (10/03) | Definitions and Existence of NE | |
Lecture 3 (10/05) | LP Duality and zero-sum games | |
Lecture 4 (10/10) | No-regret and a proof of minimax Theorem | |
Lecture 5 (10/12), (10/17) | Algorithms for computing Nash in two-player games | |
Lecture 6 (10/19) | Potential and Congestion Games | |
Lecture 7 (10/24) | Price of Anarchy | |
Lecture 8 (10/26) | Complexity Classes and AGT | |
Lecture 9 (10/31) | PLS and PPAD reductions | |
Lecture 10 (11/07) | Other notions of equilibria | |
Lecture 11 (11/14) | Intro to Mechanism Design | |
Lecture 12 (11/16) | Monotone allocations and Myerson’s lemma | |
Lecture 13 (11/21) | Virtual valuations and reserve prices | |
Lecture 14 (11/28) | Markov Games | |
Lecture 15 (11/30) | Intro to Markets |