Syllabus

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

Jan 26 | Snow day! | ||

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

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

Feb 4 | Algorithms for Two-Player Games: Lemke-Howson | Chapter 3.3, 3.4, 3.6 | HW1 released |

Feb 9 | Hardness of Computing Nash | Chapter 2, Lecture Notes from Stanford | |

Feb 11 | Potential Games and PNE; Hierarchy of Equilibria | Chapters 1.3.4, 1.3.6, 19.3.1, 19.3.2, Lecture Notes from Stanford | HW1 due |

Feb 16 | No-Regret Algorithms and Coarse Correlated Equilibria | Chapter 4, Lecture Notes from Stanford | |

Feb 18 | No-Swap-Regret and Correlated Equilibria | Chapter 4, Lecture Notes from Stanford | |

Feb 23 | Intro to Inefficiency of Equilibria | Chapter 17 | |

Feb 25 | Non-Atomic Routing Games | Chapter 18 | HW2 released |

Mar 1 | Atomic Routing Games | Chapter 18 | |

Mar 3 | Smooth Games, Facility Location | Notes from Stanford, Chapter 19.4 | |

Mar 8 | Location Game, Connection Game | Chapters 19.3, 19.4 | |

Mar 10 | Connection Game, Strong Nash | Chapter 19.3, Lecture Notes from Stanford | HW2 due |

Mar 15 | Spring Break |
||

Mar 17 | Spring Break |
||

Mar 22 | Load Balancing | Chapter 20 | |

Mar 24 | Intro to Mechanism Design | Chapters 9.3.1, 9.3.2, 9.3.5, Lecture Notes from Stanford | HW3 released |

Mar 29 | Myerson's Lemma for Single Parameter Environments | Chapters 9.4.1-9.4.2 and 9.5.4-9.5.6, Lecture Notes from Stanford | |

Mar 31 | Knapsack Auctions, Revelation Principle | Chapters 9.4.3, 12.1, 12.2. Lecture Notes from Stanford | |

Apr 5 | Revenue-Maximizing Auctions | Chapters 13.1, 13.2. Lecture Notes from Stanford | |

Apr 7 | "Simple" Approximate Auctions | Chapters 4.2, 5.2, 5.2.1 of Hartline's book, and Lecture Notes from Stanford | HW3 due, HW4 released |

Apr 12 | Bulow-Klemperer, Multi-Parameter Environments and VCG | Chapter 5.2.1 of Hartline's book, Chapter 9.3.3 of AGT book, Lecture Notes from Stanford | |

Apr 14 | Combinatorial Auctions, Spectrum Auctions | Chapters 11.1, 11.2. Lecture Notes on spectrum auctions from Stanford. | |

Apr 19 | Mechanism Design Without Money | Chapters 10.3, 10.4 | |

Apr 21 | Online Auctions | Slides from Maryland | HW4 due |

Apr 26 | Voting Schemes and Social Choice | Chapter 9.2 | |

Apr 28 | Project presentations |

- Homework 1: Due Feb 11
- Homework 2: Due March 10
- Homework 3: Due April 7
- Homework 4: Due April 21

**Feb 4:**Homework 1 has been released.**Jan 26:**Welcome to the class!

- 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