| Lec # | topics | key dates |
|---|---|---|
| 1 | Introduction | |
| 2 | Static Games | Homework 1 out |
| 3 | The Nash Equilibrium and Mixed Strategies | |
| 4 | Strict Dominance, Rationalizability, Correlated Equilibrium | Homework 1 due Homework 2 out |
| 5 | Existence of NE, Pricing Congestion Game | |
| 6 | Existence of Nash and Correlated Equilibrium | |
| 7 | Supermodular Games | Homework 2 due |
| 8 | Potential Games | |
| 9 | Computing Equilibria in Games | Homework 3 out |
| 10 | Learning in Games | Homework 3 due |
| 11 | Fictitious Play and Extensions | |
| 12 | Extensions of Fictitious Play | |
| 13 | Extensive Form Games with Perfect Information | |
| 14 | Ultimatum Game, Rubinstein-Stahl Model of Bargaining | Homework 4 out |
| 15 | Nash Bargaining Solution | |
| 16 | Repeated Games with Perfect Monitoring | Homework 4 due |
| 17 | Repeated Games, Folk Theorems | Homework 5 out |
| 18 | Static Games with Incomplete Information, Bayesian NE | Homework 5 due |
| 19 | Auctions, Revenue Equivalence Principle | |
| 20 | Mechanism Design and the Revelation Principle | |
| 21 | Optimal Mechanisms, Efficient Mechanisms (VCG) | Homework 6 out |
| 22 | VCG Applications, Budget Balancing | |
| 23 | Guest Lecture | Homwork 6 due |
| 24-25 | Project Presentations | |
| Final Papers |