Links to important resources and to essential information

• Recommended reading: Handbook on Computational Social Choice
• A simple proof of the Gibbard-Satterthwaite theorem can be found here. 
• A proof that the Uncovered Set returns the largest set of Pareto-optimal candidates can be found here. 
• Introduction to Multiwinner Voting (book chapter). 

---

Lectures

Slides from the lectures:

• Introduction to voting
• Strategic Voting
• Distortion of Voting Rules
• Apportionment
• Approval-Based Committee Elections
  • A short paper (in Polish) about Proportional Approval Voting
• Committee Elections with Ranking-Based Preferences
  • A short paper (in Polish) about the Chamberlin–Courant rule
• Participatory Budgeting
  • A short paper (in Polish) about the method of equal shares
  • Method of Equal Shares explained in 5 minutes (YouTube video)
  • The web page about the method of equal shares (the best source of information!)
• Fair Allocation of Indivisible Items
• Fair Allocation of Divisible Resources: Cake Cutting
• Kidney Exchange
  • A paper describing an ILP used to solve kidney exchange
• Stable Matchings
  • A short paper (in Polish) about stable matching
  • The paper describing the algorithm for the stable roommate problem
• The Scretary Problem and Public Decisions
  • The paper about the model of public decisions
  • The paper about the proportional multi-winner variant of the secretary problem

Recording from the lectures (available in Polish):

• Lecture 1 (Introduction to voting)
• Lecture 2 (Introduction to voting + Strategic Voting)
• Lecture 3 (Strategic Voting + Distortion)
• Lecture 4 (Distortion + Apportionment)
• Lecture 5 (Apportionment + Approval-Based Committee Elections)
• Lecture 6 (Approval-Based Committee Elections + Committee Elections with Ranking-Based Preferences)
• Lecture 7 (Participatory Budgeting)
• Lecture 8 (Fair Allocation of Indivisible Goods)
• Lecture 9 (Fair Allocation of Divisible Goods: Cake Cutting)
• Lecture 10 (Introduction to Market Design)
• Lecture 11 (Stable Matchings)

---

Assignments

The assignmnents with their due dates are available in moodle. Sollutions to the assignments must be sent through moodle.