# CS 295 - Introduction to Algorithmic Game Theory

Below we will be posting slides and lecture notes for the class. The syllabus can be found here.

Lecture 1 slides: Introductory lecture

Lecture 2 slides: Definitions and Existence of NE

Lecture 3 slides: LP Duality and zero-sum games

Lecture 4 slides: No-regret and a proof of minimax Theorem

Lecture 5 slides: Algorithms for computing Nash in two-player games

Lecture 6 slides: Potential and Congestion Games

Lecture 7 slides: Price of Anarchy

Lecture 8 slides: Complexity Classes and AGT