Display language
To modulepage Generate PDF

#40286 / #3

SS 2017 - SS 2017

English

Computational Social Choice

6

Niedermeier, Rolf

benotet

Schriftliche Prüfung

Zugehörigkeit


Fakultät IV

Institut für Softwaretechnik und Theoretische Informatik

34352500 FG Effiziente Algorithmen

No information

Kontakt


TEL 5-1

Thielcke, Christlinde

brill@tu-berlin.de

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.

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.

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Computational Social ChoiceIV3435 L 8665k.A.No information4

Workload and Credit Points

Computational Social Choice (IV):

Workload descriptionMultiplierHoursTotal
Präsenzzeit15.04.0h60.0h
Vor-/Nachbereitung15.06.0h90.0h
150.0h(~5 LP)

Course-independent workload:

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung1.030.0h30.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 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 test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Written exam

Language

English

Duration/Extent

120 Minuten

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:
Winter- und 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 reading, Lecture notes

Lecture notes

Availability:  unavailable

 

Electronical lecture notes

Availability:  available
Additional information:
Slides will be made available during the lecture period: www.isis.tu-berlin.de

 

Literature

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


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

Studiengang / StuPOStuPOsVerwendungenErste VerwendungLetzte Verwendung
This module is not used in any degree program.

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

Miscellaneous

This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/ Es erfolgte eine durch den Prüfungsausschuss genehmigte Änderung der Prüfungsform von mündlich auf schriftlich (SoSe 2017).