Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Economics and ComputationModule description #40911 / Version 1

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27).
Module / Version#40911 / #1
ValidityWS 2018/19 – WS 2019/20
Available language(s)English
Credit points6
Person responsible for the moduleNiedermeier, Rolf
GradingGraded
Exam formatWritten exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeTEL 5-1
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttp://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.

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.

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Economics and ComputationIntegrated course0434 L 240 Winter semester–4 ISIS

Workload and credit points

Economics and Computation (Integrated course)

Workload descriptionMultiplierHoursTotal
Attendance154 h60 h
Preparation and follow-up156 h90 h
150 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Exam preparation130 h30 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

GradingGraded
Exam formatWritten exam
LanguageEnglish
Duration/Extent90 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 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 is not used in any program.

Miscellaneous

Not specified