Computational Social ChoiceModule description #40286 / Version 4
- 6 CP
- Written exam
- Graded
- Summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40286 / #4 |
|---|---|
| Validity | WS 2017/18 – WS 2017/18 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Niedermeier, Rolf |
| 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:
- select and develop models,
- describe and design (efficient) algorithms, as well as
- analyze properties (z.B. computational complexity, existence or stability of solutions, characterizations)
for problems arising in the context of collective decision making.
- select and develop models,
- describe and design (efficient) algorithms, as well as
- analyze properties (z.B. computational complexity, existence or stability of solutions, characterizations)
for problems arising in the context of collective decision making.
Content
Computational Social Choice addresses problems at the interface of social choice theory with computer science. Social choice theory is the study of processes for collective decision making, such as voting rules or fair division. We discuss some of the fundamental concepts from social choice theory and related disciplines and investigate algorithmic and computational aspects.
Specific topics include:
- aggregating preferences (rank aggregation) and voting,
- algorithmic game theory,
- cake cutting protocols,
- fair allocation of recourses,
- judgment aggregation,
- stable matching.
Specific topics include:
- aggregating preferences (rank aggregation) and voting,
- algorithmic game theory,
- cake cutting protocols,
- fair allocation of recourses,
- judgment aggregation,
- stable matching.
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 | Summer semester | [en] | 6 | 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 in which distributed work sheets are solved together.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic knowledge about algorithms and computational complexity.
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: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
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.
- 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.
Assigned programs
This module is not used in any program.
Miscellaneous
This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/