These are my (unofficial) lecture notes for the lecture Computational Social Choice held by Prof. F. Brandt at the Technical University Munich in the winter semester 2021/22.

Topics covered include:

  • basic properties of social choice functions, such as neutrality, monotonicity or rationalizability
  • Arrow’s impossiblity theorem
  • the social preference function Kemeny’s rule
  • social choice functions such as the top cycle, the uncovered set, the banks set or the tournament equilibrium set
  • the Gibbard-Satterthwaite impossibility theorem
  • the basics of probabilistic social choice theory