Syllabus

Date | Topic | Reference | Notes |
---|---|---|---|

Jan 30 | Introduction. What is AGT? Basic Game Theory | Chapter 1, Lecture notes from Stanford | |

Feb 1 | Two-Player Zero-sum Games | Chapters 1.4.2, 3.1, 3.2 | |

Feb 6 | Algorithms for Two-Player Games | Chapters 2.3, 3.2, 3.3, 3.4 | |

Feb 7 | Hardness of Computing Nash: PPAD | Chapters 2.1 - 2.6, Lecture Notes from Stanford | |

Feb 13 | Potential Games and PNE; Hierarchy of Equilibria | Chapters 1.3, 19.3.1, 19.3.2 | |

Feb 15 | No-Regret and Coarse Correlated Equilibria | Chapters 4.1-4.4, Lecture Notes from Stanford | HW1 released |

Feb 20 | No-Regret and Coarse Correlated Equilibria (continued) | Chapters 4.1-4.4, Lecture Notes from Stanford |

- An Algorithmic Game Theory Primer, Tim Roughgarden.
- Mechanism Design and Approximation, Jason Hartline.
- Multiagent Systems, Yoav Shoham and Keven Leyton-Brown, Cambridge University Press, 2009.

- Algorithmic Game Theory at Stanford by Tim Roughgarden
- Algorithmic Game Theory at Maryland by Mohammad Hajiaghayi
- Algorithms, Games, and Networks at CMU by Avrim Blum and Ariel Procaccia
- Introduction to Algorithmic Game Theory at Columbia by Sergei Vassilvitskii and Sébastien Lahaie