Week | Date | Topic | By | Slides | Further reading |
1 | 8-26 | Introduction to the course | Lirong Xia | ||
8-29 Upcoming | Basic social choice: voting rules, axiomatic characterizations | Lirong Xia | SLB 9.1-9.4 | ||
9-2 Labor day | No class | ||||
2 | 9-5 | Basic game theory: normal form games and Nash equilibrium; extensive form games, subgame perfect equilibrium, backward induction. | Lirong Xia | SLB 3.2; 3.3-3.3.2; 5.1 | |
3 | 9-9 | Basic mechanism design: revelation principle, VCG mechanisms, auctions | Lirong Xia | ||
9-12 HW1 due before class | Linear and integer programming, computational complexity | Lirong Xia | |||
4 | 9-16 | Computational Social Choice: The easy-to-compute axiom | Lirong Xia | ||
9-19 | Computational Social Choice: The hard-to-manpulate axiom | Lirong Xia | |||
5 | 9-23 | Computational Social Choice: Combinatorial voting | Lirong Xia | ||
9-26 | Computational Social Choice: Statistical approaches | Lirong Xia | |||
6 | 9-30 | Judgement aggregation | Lirong Xia | ||
10-3 | Matching | Lirong Xia | |||
7 | 10-7 | Recommender systems | Lirong Xia | ||
10-10 | Fair division | Lirong Xia | |||
10-14 Columbus Day | No class | ||||
8 | 10-17 | Paper presentation | |||
9 | 10-21 | Paper presentation | |||
10-24 | Paper presentation | ||||
10 | 10-28 Project proposal due |
Paper presentation | |||
10-31 | Paper presentation | ||||
11 | 11-4 | Paper presentation | |||
11-7 | Paper presentation | ||||
12 | 11-11 | Paper presentation | |||
11-14 | Paper presentation | ||||
13 | 11-18 | Paper presentation | |||
11-21 | Paper presentation | ||||
14 | 11-25 | Paper presentation | |||
11-28 Thanks giving |
No class | ||||
15 | 12-2 | Project presentation | |||
12-5 | Project presentation | ||||
16 | 12-7 |
||||