Navigation To modulepage
Display language

Computational Social Choice



#40286 / #6

Seit SS 2019
(Deaktivierung beantragt zum SoSe 2022)

Fakultät IV

TEL 5-1

Institut für Softwaretechnik und Theoretische Informatik

34352500 FG Effiziente Algorithmen

Brill, Markus

Thielcke, Christlinde

POS-Nummer PORD-Nummer Modultitel
2346486 37465 Computational Social Choice
2348563 40680 Computational Social Choice

Learning Outcomes

On successful completion, students will be able to: - understand fundamental tradeoffs, - model preferences and aggregation methods, - develop (efficient) algorithms, and - analyze axiomatic and computational properties in the context of collective decision making.


Computational Social Choice (COMSOC) addresses problems at the interface of social choice theory and computer science. Social choice theory is the formal study of collective decision making processes, an important example of which are voting rules. We discuss fundamental concepts from social choice theory and investigate axiomatic and computational aspects. Specific topics include: - Arrow's impossibility result, - restricted domains of preferences, - social preference functions, - tournament solutions, - strategic voting, and - multiwinner elections.

Module Components


All Courses are mandatory.

Course Name Type Number Cycle Language SWS VZ
Computational Social Choice IV 3435 L 8665 SS English 6

Workload and Credit Points

Computational Social Choice (IV):

Workload description Multiplier Hours Total
Präsenzzeit 15.0 6.0h 90.0h
Vor-/Nachbereitung 15.0 10.0h 150.0h
240.0h(~8 LP)

Course-independent workload:

Workload description Multiplier Hours Total
Prüfungsvorbereitung 1.0 30.0h 30.0h
30.0h(~1 LP)
The Workload of the module sums up to 270.0 Hours. Therefore the module contains 9 Credits.

Description of Teaching and Learning Methods

The course material is presented in lectures. The lectures are accompanied by tutorials.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge of discrete mathematics, algorithms, and computational complexity. Familiarity with formal proof methods.

Mandatory requirements for the module test application:

No information

Module completion



Type of exam

Written exam




120 min

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:

Maximum Number of Participants

The maximum capacity of students is 40.

Registration Procedures

Please register at QISPOS or directly at the examination office.

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable

Electronical lecture notes

Availability:  available
Additional information:
Slides will be made available during the lecture period:


Recommended literature
F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, ed.: Handbook of Computational Social Choice. Cambridge University Press, 2015.
H. Moulin: Axioms of Cooperative Decision Making. Cambridge University Press, 1988
W. Gaertner: A Primer in Social Choice Theory. Oxford University Press, 2009

Assigned Degree Programs

This module is used in the following Degree Programs (new System):

This moduleversion is used in the following modulelists:


No information