| Date | Topics | Reading | Announcements |
| Tue. 1/20 | Course overview and logistics | | Homework 0 released |
| Thu. 1/22 | Begin Ch1, normal form games, safe strategies,
dominant strategy and Nash equilibria, | KP Chapter 4,
AG Lecture on NFGs | |
| Tue. 1/27 | Indifference principle,
computing NE using the indifference principle | KP Chapter 4,
Optional: TRA Lectures 19, 20 | |
| Thu. 1/29 | Potential games,
Repeated play and best response dynamics | KP Chapter 4,
TRA Lectures 13, 16 | Homework 0 due on 1/30 |
| Tue. 2/3 | Necessary conditions for convergence of RPD/BRD,
Price of Anarchy/Stability | KP Chapters 4, 8,
TRA Lecture 11 | Homework 1 released on 01/31 |
| Thu. 2/5 | PoA/PoS (cont'd), Selfish routing,
Correlated and coarse correlated equilibria | KP Chapters 8, 7.2,
TRA Lectures 11, 13 | |
| Tue. 2/10 | Correlated and coarse correlated equilibria (cont'd),
Begin Ch2, Zero sum games, minimax theorem | KP Chapters 7.2, 2 | |
| Thu. 2/12 | Minimax theorem (cont'd),
Case study: Generative adversarial networks,
| KP Chapter 2,
GANs paper | Homework 1 due on 2/13 |
| Tue. 2/17 | Begin Ch3, Review of linear programming,
Computing safe strategies via LPs | KP Appendix A | Homework 2 released on 02/14 |
| Thu. 2/19 | Computing CE and CCE via LPs | KP Appendix A | |
| Tue. 2/24 | Begin Ch4, Introduction to online learning,
The experts problem | KP Chapter 18 | |
| Thu. 2/26 | Hedge algorithm (cont'd), Adversarial bandits and EXP3,
Begin Ch5, No-regret dynamics | KP Chapter 18,
TRA lecture 17 | Homework 2 due on 2/27 |
| Tue. 3/3 | No-regret dynamics (cont'd),
Convergence to NE in
zero sum games | KP Chapter 18,
TRA lectures 17, 18 | Homework 3 released on 02/28 |
| Thu. 3/5 | Convegence to CCE in general sum games,
Swap regret and convergence to CCE | TRA lectures 17, 18,
Blum & Mansour 2007 | |
| Tue. 3/10 | Swap regret and CCE (cont'd),
Begin Ch6, Introduction to mechansim design, stable matching | KP Chapter 10,
TRA lecture 10 | |
| Thu. 3/12 | Stable matching (cont'd), attainability
and incentive compatibility | KP Chapter 10,
TRA lecture 10 | Homework 3 due on 3/13 |
| Tue. 3/17 | Incentive-compatibility in stable matching (cont'd)
Midterm exam review | KP Chapter 10,
TRA lecture 10 | Homework 4 released on 03/14 |
| Wed. 3/18 | Midterm exam, 5.45 PM – 7.15 PM, Morgridge Hall 1524 | | |
| Thu. 3/19 | One-sided matching and Top Trading Cycles,
Fair resource allocation | KP Chapter 10,
KSGJS ’21 Section 2.1, 2.2 | |
| Tue. 3/24 | Pareto-efficiency in resource allocation,
The max-min fairness algorithm | KSGJS ’21 Section 2.1, 2.2 | |
| Thu. 3/26 | IC in max-min fairness,
Begin Ch8, Simple auctions | KP Chapters 14.1 | Homework 4 due on 3/27 |
| Tue. 3/31 | Spring break | | Homework 5 released on 03/28 |
| Thu. 4/2 | Spring break | | |
| Tue. 4/7 | The VCG mechanism | KP Chapters 15, 16 | |
| Thu. 4/9 | Truthfulness in single-parameter mechanisms | KP Chapter 14 | |
| Tue. 4/14 | | | |
| Thu. 4/16 | | | Homework 5 due on 4/17 |
| Tue. 4/21 | | | |
| Thu. 4/23 | | | |
| Tue. 4/28 | | | |
| Thu. 4/30 | | | Homework 6 due on 5/01 |
| Wed. 5/06 | Final exam, 12.25 PM – 2.25 PM | | |
|
|