Economics and ComputationModule description #40911 / Version 3
- 6 CP
- Written exam
- Graded
- Summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40911 / #3 |
|---|---|
| Validity | Summer semester 2021 – Winter semester 2021/22 |
| 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 | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | TEL 5-1 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | http://www.akt.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 and related fields.
- 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 and related fields.
Content
The course addresses problems at the interface 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,
- algorithmic game theory,
- cake cutting protocols,
- fair allocation of recourses,
- judgment aggregation,
- opinion diffusion, and
- stable matching.
Specific topics include:
- aggregating preferences (rank aggregation) and voting,
- algorithmic game theory,
- cake cutting protocols,
- fair allocation of recourses,
- judgment aggregation,
- opinion diffusion, and
- stable matching.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Economics and Computation | Integrated course | 0434 L 240 | Summer semester | [en] | 4 | ISIS |
Workload and credit points
Economics and Computation (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Preparation and follow-up | 15 | 6 h | 90 h |
| 150 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam preparation | 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 an active participation and homework is required.
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, German |
| Duration/Extent | 90 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
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 version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2015 | SS 2021 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks |
| WS 2021/22 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks |
Miscellaneous
Not specified