Week  Date  Topic  By  Slides  Further reading 
1  126  Introduction to the course  Lirong Xia  
129  Basic social choice: voting rules, axiomatic characterizations  Lirong Xia  SLB 9.19.4  
2  22  Basic game theory: normal form games and Nash equilibrium; extensive form games, subgame perfect equilibrium, backward induction.  Lirong Xia  SLB 3.2; 3.33.3.2; 5.1  
25 Add deadline  Basic mechanism design: revelation principle, VCG mechanisms, auctions  Lirong Xia  Mechanism Theory  
3  29  Linear and integer programming, computational complexity  Lirong Xia  CACM  
212 
Computational Social Choice: The easytocompute axiom  Lirong Xia  The book chapter on Piazza  
4  216  no class  
219 HW1 due  Computational Social Choice: Combinatorial voting  Lirong Xia  
5  223  Computational Social Choice: The hardtomanpulate axiom  Lirong Xia  
226  Computational Social Choice: Statistical approaches  Lirong Xia  
6  31 HW2 due  Matching  Lirong Xia  
34  Fair division  Lirong Xia  End10  
7  38  Judgement aggregation  Lirong Xia  List12  
311 Drop deadline 
Hypothesis testing and statistical decision theory  Lirong Xia  
8  315 spring break  
318 spring break  
9  322 Paper preferences due  
325  Hypothesis testing and statistical decision theory  Lirong Xia  
10  329  Hypothesis testing and statistical decision theory  Lirong Xia  
41  Recommender systems 
Lirong Xia  A nice book chapter  
11  45  Topic: Learning Zhibing Zhao, Peter Piech, Lirong Xia. Learning Mixtures of PlackettLuce models. 
Zhibing  
48 Project proposal due  Topic: USNews Ethan Gertle, Erika Mackin, Malik MagdonIsmail, Lirong Xia, and Yuan Yi. Computing Manipulations of Ranking Systems. AAMAS15. 
Ben  
12  412  Presentation 1 Topic: Fair allocation: Random serial dictatorships Anna Bogomolnaia and HerveMoulin. A New Solution to the Random Assignment Problem. JET 2001. Presentation 2 Topic: Voting Elliot Anshelevich, Onkar Bhardwaj, and John Postl. Approximating Optimal Social Choice under Metric Preferences. Proc. of 29th Conference on Artificial Intelligence (AAAI 2015).

Sam/Stephen  Related papers:


415  Presentaion 1 Topic: Ensemble learning: AdaBoost Yoav Freund and Robert E. Schapire. A Short Introduction to Boosting. Presentation 2 Topic: A new class of voting rules Lirong Xia. Generalized Scoring Rules: A Framework That Reconciles Borda and Condorcet. SIGecom Exchanges, 2013. 
Ryan/ Jason  
13  419  Presentation 1 Topic: RankNet Christopher J.C. Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. Learning to Rank using Gradient Descent. ICML05. Presentation 2 Topic: Strategic voting David AustenSmith and Jeffrey S. Banks. Information Aggregation, Rationality, and the Condorcet Jury Theorem. The American Political Science Review, 1996. 
Kevin/ Maggie  
422  Presentation 1 Topic: Peer prediction Nolan Miller, Paul Resnick, and Richard Zeckhauser. Eliciting Informative Feedback: The PeerPrediction Method. Management Science, 2005 Presentation 2 Topic: Allocation Ghodsi, Ali and Zaharia, Matei and Hindman, Benjamin and Konwinski, Andy and Shenker, Scott and Stoica, Ion. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types. In Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, pages 323–336, Boston, MA, USA, 2011. 
David/ Lucien 


14  426  Topic: Allocation of indivisible items Erika Mackin and Lirong Xia. Allocating indivisible items in categorized domains. working paper. 
Jeremy  
429  Presentation 1 Topic: Voting where candidates=voters Holzman, R., and Moulin, H. (2013) Impartial nominations for a prize. Econometrica, 81 (1). pp. 173196. 
Tyler  
15  53  Project presentation: Zhibing, Ben, Stephen  
56 
Project presentation: Jason, Kevin, Maggie/Tyler  
16  510 
Project presentation: David/Sam, Lucien/Ryan, Jeremy 

513 Final project report due  
17 


