Computational Social ChoiceModule description #40286 / Version 5
- 6 CP
- Written exam
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40286 / #5 |
|---|---|
| Validity | SS 2018 – WS 2018/19 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Brill, Markus |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352500 FG Effiziente Algorithmen |
Contact
| Office | TEL 5-1 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | brill@tu-berlin.de |
| Website | http://www.algo.tu-berlin.de/menue/teaching/ |
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.
- understand fundamental tradeoffs,
- model preferences and aggregation methods,
- develop (efficient) algorithms, and
- analyze axiomatic and computational properties
in the context of collective decision making.
Content
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.
- Arrow's impossibility result,
- restricted domains of preferences,
- social preference functions,
- tournament solutions,
- strategic voting, and
- multiwinner elections.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Computational Social Choice | Integrated course | 3435 L 8665 | Irregular | – | 4 | ISIS |
Workload and credit points
Computational Social Choice (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 4 h | 60 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 150 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Prüfungsvorbereitung | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
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 examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | English |
| Duration/Extent | 120 min |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
The maximum capacity of participants is 45.
Registration procedures
Please register at QISPOS or directly at the examination office.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Slides will be made available during the lecture period: www.isis.tu-berlin.de
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 programs
This module is not used in any program.
Miscellaneous
Not specified