Syllabus

- Algorithmic Game Theory, Nisan, Roughgarden, Tardos, and Vazirani, Cambridge University Press, 2007.
- Twenty Lectures on Algorithmic Game Theory, Tim Roughgarden, Cambridge University Press, 2016.

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

Jan 25 | Introduction. What is AGT? Basic Game Theory | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 1 | |

Jan 27 | Two-Player Zero-sum Games | Lecture Notes, Lecture Board, Video, NRTV Chapters 1.4.2, 3.1, 3.2 | HW1 released |

Feb 1 | Algorithms for Two-Player Games: Lemke-Howson | Lecture Notes, Lecture Board, Video, NRTV Chapters 2.3, 3.2 - 3.6 | |

Feb 3 | Hardness of Computing Nash: PPAD | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 20, NRTV Chapters 2.1 - 2.6 | |

Feb 8 | Potential Games and PNE; Hierarchy of Equilibria | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 13, NRTV Chapter 1.3 | |

Feb 10 | No-Regret and Coarse Correlated Equilibria | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 17, NRTV Chapters 4.1-4.4 | HW1 due, HW2 released |

Feb 15 | No-Regret and Equilibria (continued) | Lecture Notes, Lecture Board, Video, Roughgarden Chapters 17, 18, NRTV Chapters 4.1-4.4 | |

Feb 17 | No-Swap-Regret and Correlated Equilibria | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 18, NRTV Chapters 4.4, 4.5 | |

Feb 22 | Introduction to Inefficiency of Equilibria | Lecture Notes, Lecture Board, Video, NRTV Chapter 17 | |

Feb 24 | Nonatomic Routing Games | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 11, NRTV Chapters 18.1, 18.2.1, 18.3.1, 18.4.1 | HW2 due, HW3 released |

Mar 1 | Atomic Routing Games, Smooth Games | Lecture Notes, Lecture Board, Video, Roughgarden Chapters 12, 14, NRTV Chapter 18 | |

Mar 3 | Facility Location Game | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 14.2, NRTV Chapter 19.4 | |

Mar 8 | Connection Game, Strong Nash | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 15, NRTV Chapter 19.3 | |

Mar 10 | Load Balancing | Lecture Notes, Lecture Board, Video, NRTV Chapter 20 | HW3 due, HW4 released |

Mar 15 | Introduction to Mechanism Design | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 2, NRTV Chapters 9.1, 9.3.1, 9.3.2, 9.3.5 | |

Mar 17 | Single-Parameter Environments (Myerson's Lemma) | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 3, NRTV Chapters 9.5.4, 9.5.5 | |

Mar 22 | No class - Spring Break |
||

Mar 24 | No class - Spring Break |
||

Mar 29 | Knapsack Auctions and the Revelation Principle | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 4, NRTV Chapters 9.4.3, 12.1, 12.2 | |

Mar 31 | Revenue Maximizing Auctions | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 5, NRTV Chapters 13.1, 13.2 | HW4 due, HW5 released |

Apr 5 | "Simple" Auctions and Bulow-Klemperer | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 6 | |

Apr 7 | VCG and General Mechanism Design | Lecture Notes, Lecture Board, Video, Roughgarden Chapter 7, NRTV Chapter 9.3.3 | |

Apr 12 | Combinatorial Auctions I | Lecture Notes, Lecture Board, Video, NRTV Chapters 11.1, 11.2 | |

Apr 14 | Combinatorial Auctions II | Lecture Board, Video, NRTV Chapter 11.3 | HW5 due, HW6 released |

Apr 19 | Mechanisms Without Money | Lecture Notes, Lecture Board, Video, NRTV Chapters 10.3, 10.4, Roughgarden Chapters 9.4, 10 | |

Apr 21 | Online Auctions | Lecture Notes, Lecture Board, Video, Slides from Maryland, NRTV Chapter 16.1 - 16.3. | |

Apr 26 | Voting Schemes and Social Choice | Lecture Notes, Lecture Board, Video, NRTV Chapter 9.2 | |

Apr 28 | Voting Schemes and Social Choice II | Lecture Board, Video | HW6 due |

- Homework 1: PDF, LaTeX. Solutions.
- Homework 2: PDF, LaTeX. Solutions.
- Homework 3: PDF, LaTeX. Solutions.
- Homework 4: PDF, LaTeX. Solutions.
- Homework 5: PDF, LaTeX. Solutions.
- Homework 6: PDF, LaTeX. Solutions
- Final Project: Due May 12 by 5pm on Gradescope (one submission per group)

- One option will be to read a modern research paper on algorithmic game theory and write up an overview. Good conferences to look for interesting papers are EC (Electronic Commerce), WINE (Workshop in Internet and Network Economics), SAGT (Symposium on Algorithmic Game Theory), STOC, FOCS, and SODA.
- Similarly, a survey paper or summary of some part of AGT that we did not fully cover in class would make an excellent project
- You are also more than welcome to conduct original research paper using ideas from the course, presumably combined with your personal research interests
- You may work in groups of up to three if you wish.

- 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