CSCE 689
Home
Syllabus
CSCE 689: Algorithmic Game Theory
Announcements
<2023-09-26 Tue> Homework 2 is posted. It is due Sunday, October 8, 2023 11:59pm.
<2023-09-06 Wed> All parts of Homework 1 are posted. It is due at the beginning of class, Thursday, 9/14.
<2023-08-17 Thu> Welcome to Algorithmic Game Theory! Please familiarize yourself with the syllabus.
Homework Assignments
Homework 1, Part 1
Homework 1, Part 2
Homework 2
Homework 3
Homework 4
Schedule
Week
Topic
Lecture Slides
Reading
1
Introduction and Games in Normal Form
Introduction to Algorithmic Game Theory
Games in Normal Form
Utility and Preferences
Solution Concepts I
AGT, Ch. 1.1-1.3
MAS, Ch. 3.1-3.3
2
Solution Concepts for NF games
Solution Concepts II
Nash Equilibria -- Computational Questions
AGT, Ch. 2.2
MAS, Ch. 3.4, 4.1, 4.2
3
Computing Equilibria
Algorithms to Compute a Nash Equilibrium
Computing Maxmin, Minmax
Computing Correlated Equilibria
Other Computational Questions
AGT, Ch. 3
MAS, Ch. 4.2, 4.4, 4.6
4
Extensive-Form Games
Extensive-Form Games with Perfect Information
Extensive-Form Games with Imperfect Information
Repeated Games
AGT, Ch. 3
MAS, Ch. 5
5
Markets and Equilibria
Markets and Algorithmic Issues
Fisher's Linear Case
Stochastic Games
AGT, Ch. 5
6
Markets and Equilibria
Arrow-Debreu Model, Linear Case
Scheduling Auction
AGT, Ch. 5