CS 280 - Algorithmic Game Theory - Fall, 2026

Instructor: Ioannis Panageas
Email: ipanagea at ics dot uci dot edu
Office hours: By appointment

Class announcements

Class announcements will be made on Edstem. Please check there frequently.

Class meetings

Lectures: 12:30–1:50 p.m., Tuesdays and Thursdays, DBH 1300 (in person).

Questions of general interest about the course material, the homework, and the projects should be posted on Edstem.

Syllabus

The Fall 2026 syllabus, including grading policy can be found here.

Textbook

Required textbook. [AGT] Algorithmic Game Theory, by eds Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay V. Vazirani.
Recommended lecture notes. [Rou] Algorithmic Game Theory, by Tim Roughgarden.

Schedule of classes

Lecture no.	Topics	Reading - Comments
Lecture 1 (9/24)	Administrivia, Introduction	L1
Lecture 2 (9/29)	Definitions and Existence of Nash Equilibrium	L2
Lecture 3 (10/01)	LP duality and zero-sum games	L3
Lecture 4 (10/06)	Algorithms for computing Nash in two-player games	L4
Lecture 5 (10/08)	Potential and Congestion Games	L5
Lecture 6 (10/13, 10/15, 10/20)	Complexity Classes	L6
Lecture 7 (10/22)	Other Equilibrium notions	L7
11/26	No class — Thanksgiving holiday

Homework Assignments

The homework assignments will be posted in Edstem and Gradescope.

If you have difficulty accessing course materials, please email Ioannis Panageas for assistance.