Homework

Assignments

Assignment #1: due 2/12/2025
Nash equilibrium, equilibrium computation, extensive-form games
[ problems | solutions ] 

Assignment #2: due 2/26/2025
The price of anarchy, voting rules, the epistemic approach to voting, strategic manipulation in elections
[ problems | solutions ] 

Assignment #3: due 3/24/2025 
The VCG Mechanism, strategyproof approximation algorithms, cake cutting, rent division
[ problems | solutions ] 

Assignment #4: due 4/7/2025
Indivisible goods, online matching algorithms, kidney exchange, stable matching
[ problems | solutions ] 

Assignment #5: due 4/30/2025
Random assignment, cascade models, influence maximization, Minimax Theorem via no-regret learning, feature attribution
[ problems | solutions ] 

Policies

• The solutions to some of the problems that we give can be found in papers or books, but you should avoid reading the proof if you come across it. If for some reason you did see the solution before working it out yourself, please say so in your solution.  

• While we do not recommend it, you may use AI (e.g., ChatGPT) to tackle the assignments. If you did, please say so and explain where it was useful. 

• You may discuss the problems with classmates but please write down solutions completely on your own. 

• Please type up your solution and submit to Gradescope. 

• You have a total of 5 late days, which can be spread across assignments. However, the maximum number of late days that can be applied to a single assignment is 2. Assignments submitted when late days (maximum or total) have been exceeded will not be graded. 

• Regrade requests must be submitted via Gradescope within 5 days from the time grades are released.