Lehre » Winter 20/21 » Algorithmics for Politics
||Time / Place
||Mo, 14:30 - 16:00 / Zoom
Do, 10:30 - 12:00 / Zoom
||February or March 2021 / ???
||March or April 2021 / ???
The course deals with the computational aspects of collective decision making.
It covers a variety of topics at the intersection of theoretical computer science,
mathematics, economics, and political sciences, as for instance
- algorithmic properties of voting systems
- the manipulation of voting rules
- the measurement of political power
- the fair allocation of collective goods
- apportionment of parliamentary seats
- districting and gerrymandering
The Zoom link to the lectures can be found in the Moodle.
The final exam will be in written form.
Time and place of the exam will be announced at a later moment in time.
To be admitted to the exam you must achieve at least 50% of all possible points on the exercise sheets.
The exercise sheets will be released in the moodle room where you should also hand them in.
The sheets will be released weekly and should be solved in groups.
We will announce the group size once we have a concrete idea of the number of participating students.
- Jörg Rothe: Economics and Computation. Springer, 2016.
- F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia:
Handbook of Computational Social Choice. Cambridge University Press, 2016.
- J.M. Robertson and W.A. Webb: Cake-cutting algorithms: Be fair if you can. A.K. Peters Ltd, 1998.
- Michel Balinski and Peyton Young: Fair Representation: Meeting the Ideal of One Man, One Vote. Yale University Press, 1982.
- Further reading: List of references