192.118 Algorithmic Social Choice
Diese Lehrveranstaltung ist in allen zugeordneten Curricula Teil der STEOP.
Diese Lehrveranstaltung ist in mindestens einem zugeordneten Curriculum Teil der STEOP.

2021S, VU, 4.0h, 6.0EC


  • Semesterwochenstunden: 4.0
  • ECTS: 6.0
  • Typ: VU Vorlesung mit Übung
  • Format der Abhaltung: Online


Nach positiver Absolvierung der Lehrveranstaltung sind Studierende in der Lage...

After successful completion of the course, students will be able to:

  • explain and identify basic concepts, structures, and problems from collective decision making,
  • describe and design efficient algorithms, and analyze properties (e.g., computational complexity, existence or stability of solutions, characterizations) of problems arising in the context of collective decision making and related fields.

Inhalt der Lehrveranstaltung

The course addresses problems at the intersection of economics, social choice theory, and computer science. The focus is on processes of algorithmic decision making, such as voting rules or fair division. We discuss fundamental concepts from collective decision making and related topics and investigate algorithmic and computational aspects.

Specific topics include:

  • aggregating preferences (rank aggregation) and voting,
  • preference domain restrictions,
  • matchings under preferences,
  • algorithmic mechanism design,
  • cake cutting protocols,
  • fair allocation of resources, and
  • judgment aggregation.


The course will consist of lectures and 4 exercise units. The students will receive an exercise sheet 1-2 weeks before each exercise and are expected to submit their solutions in advance and also to be able to present the solutions on the whiteboard. Exercise sheets will be available for download.

The first lecture takes place on March 5th, 10:15-11:15, via Zoom.

Please register and go to the Tuwel forum to see the zoom link.



Weitere Informationen

ECTS Breakdown

36 h: Lectures
68 h: Solving and presenting the solutions of the 4 exercise sheets
22 h: Preparation and follow-up
23.5 h: Exam preparation
0.5 h: Exam

Sum: 150 h



  • F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, ed.:Handbook of Computational Social Choice. Cambridge University Press, 2015.
  • U. Endriss, ed: Trends in Computational Social Choice. AI Access, 2017
  • D. Gusfield and R. Irving: The Stable Marriage Problem--Structure and Algorithms. MIT Press, 1989
  • D. Manlove: Algorithmics of Matchihng under Preferences, World Scientific Press, 2013
  • J. Rothe, ed.: Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer, 2015
  • Y. Shoham, K. Leyton-Brown: Multiagent Systems. Cambridge University Press, 2009

Vortragende Personen


LVA Termine

Fr.10:15 - 11:3005.03.2021 zoom (LIVE)Introductory session
Mi.14:00 - 16:0010.03.2021 - 30.06.2021 zoom (LIVE)Lecture/exercises
Fr.10:15 - 11:4512.03.2021 - 02.07.2021 zoom (LIVE)Lecture/exercises
Algorithmic Social Choice - Einzeltermine
Fr.05.03.202110:15 - 11:30 zoomIntroductory session
Mi.10.03.202114:00 - 16:00 zoomLecture/exercises
Fr.12.03.202110:15 - 11:45 zoomLecture/exercises
Mi.17.03.202114:00 - 16:00 zoomLecture/exercises
Fr.19.03.202110:15 - 11:45 zoomLecture/exercises
Mi.24.03.202114:00 - 16:00 zoomLecture/exercises
Fr.26.03.202110:15 - 11:45 zoomLecture/exercises
Mi.31.03.202114:00 - 16:00 zoomLecture/exercises
Fr.02.04.202110:15 - 11:45 zoomLecture/exercises
Mi.07.04.202114:00 - 16:00 zoomLecture/exercises
Fr.09.04.202110:15 - 11:45 zoomLecture/exercises
Mi.14.04.202114:00 - 16:00 zoomLecture/exercises
Fr.16.04.202110:15 - 11:45 zoomLecture/exercises
Mi.21.04.202114:00 - 16:00 zoomLecture/exercises
Fr.23.04.202110:15 - 11:45 zoomLecture/exercises
Mi.28.04.202114:00 - 16:00 zoomLecture/exercises
Fr.30.04.202110:15 - 11:45 zoomLecture/exercises
Mi.05.05.202114:00 - 16:00 zoomLecture/exercises
Fr.07.05.202110:15 - 11:45 zoomLecture/exercises
Mi.12.05.202114:00 - 16:00 zoomLecture/exercises


Exercise + oral exam



Von Bis Abmeldung bis
18.02.2021 00:00 08.03.2021 23:55


066 504 Masterstudium Embedded Systems Gebundenes Wahlfach
066 931 Logic and Computation Gebundenes Wahlfach
066 937 Software Engineering & Internet Computing Gebundenes Wahlfach
066 950 Informatikdidaktik Gebundenes Wahlfach


Es wird kein Skriptum zur Lehrveranstaltung angeboten.


Basic knowledge of algorithmic design. Good to have heard:

  1. Algorithmen und Datenstrukturen,
  2. Algorithmics,
  3. Komplexitätstheorie, etc.