| 1 | Introduction | |
| 2 | Decision Theory | |
| 3 | Representation of Games | |
| 4 | Dominance | |
| 5 | Rationalizability | Problem set 1 due |
| 6 | Nash Equilibrium | |
| 7 | Imperfect Competition | |
| 8 | Backward Induction | Problem set 2 due |
| 9 | Negotiation | |
| | Midterm 1 | |
| 10 | Subgame-Perfect Nash Equilibrium | |
| 11
| Single Deviation-Principle
| Problem set 3 due |
| 12
| Finitely-Repeated Games | |
| 13-14 | Infinitely Repeated Games II | Problem set 4 due |
| | Midterm 2 | |
| 15
| Implicit Cartels | |
| 16 | Incomplete Information (Static Case) | Problem set 5 due |
| 17-19 | Static Applications with Incomplete Information | |
| 20-23
| Dynamic Games with Incomplete Information
| |
| | Final Exam | |
