Moses - Economics and Computation

Display language

To modulepage Generate PDF

Diese Modulbeschreibung gilt nicht im aktuellen Semester.

Die Modulbeschreibung gilt nur für den Zeitraum SoSe 2021 - WiSe 2021/22.

Module / Version:
#40911 / #3

Validity:
SoSe 2021 - WiSe 2021/22

Default display language:
English

Module title:
Economics and Computation

Credits:
6

Responsible person:
Niedermeier, Rolf

Grading:
benotet

Type of exam:
Schriftliche Prüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Softwaretechnik und Theoretische Informatik

Area of expertise:
34351100 FG Algorithmik und Komplexitätstheorie

Prüfungsausschuss:
No information

Kontakt

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.

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

Pflichtgruppe:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Economics and Computation	IV	0434 L 240	SoSe	English	4

Workload and Credit Points

Economics and Computation (IV):

Workload description	Multiplier	Hours	Total
Attendance	15.0	4.0h	60.0h
Preparation and follow-up	15.0	6.0h	90.0h
			150.0h(~5 LP)

Course-independent workload:

Workload description	Multiplier	Hours	Total
Exam preparation	1.0	30.0h	30.0h
			30.0h(~1 LP)

The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

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 test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Written exam

Language

German/English

Duration/Extent

90 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:
Sommersemester.

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 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 Degree Programs

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

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

	Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Miscellaneous

No information

Economics and Computation