Moses - Computational Social Choice

Display language

To modulepage Generate PDF Generate XML

Module / Version:
#40286 / #6

Validity:
SS 2019 - SoSe 2022

Default display language:
English

Module title:
Computational Social Choice

Credits:
9

Responsible person:
Brill, Markus

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:
34352500 FG Effiziente Algorithmen

Prüfungsausschuss:
No information

Kontakt

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: - understand fundamental tradeoffs, - model preferences and aggregation methods, - develop (efficient) algorithms, and - analyze axiomatic and computational properties in the context of collective decision making.

Content

Computational Social Choice (COMSOC) addresses problems at the interface of social choice theory and computer science. Social choice theory is the formal study of collective decision making processes, an important example of which are voting rules. We discuss fundamental concepts from social choice theory and investigate axiomatic and computational aspects. Specific topics include: - Arrow's impossibility result, - restricted domains of preferences, - social preference functions, - tournament solutions, - strategic voting, and - multiwinner elections.

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Computational Social Choice	IV	3435 L 8665	SoSe	English	6

Workload and Credit Points

Computational Social Choice (IV):

Workload description	Multiplier	Hours	Total
			240.0h(~8 LP)
Präsenzzeit	15.0	6.0h	90.0h
Vor-/Nachbereitung	15.0	10.0h	150.0h

Course-independent workload:

Workload description	Multiplier	Hours	Total
			30.0h(~1 LP)
Prüfungsvorbereitung	1.0	30.0h	30.0h

The Workload of the module sums up to 270.0 Hours. Therefore the module contains 9 Credits.

Description of Teaching and Learning Methods

The course material is presented in lectures. The lectures are accompanied by tutorials.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge of discrete mathematics, algorithms, and computational complexity. Familiarity with formal proof methods.

Mandatory requirements for the module test application:

No information

Module completion

Grading

graded

Type of exam

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.

This module may be commenced in the following semesters:
Sommersemester.

Maximum Number of Participants

The maximum capacity of students is 40.

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.
H. Moulin: Axioms of Cooperative Decision Making. Cambridge University Press, 1988
W. Gaertner: A Primer in Social Choice Theory. Oxford 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.

Miscellaneous