Topics in Computational Social Choice

What it is about

You study models and methods of collective decision making from social choice theory, in particular those that find application in computer science. Key topics are probabilistic social choice, fair division, and the allocation of public goods; the contents are treated mathematically precisely and with a focus on proofs. In the end you will be able to apply such models, axiomatically analyze properties of aggregation procedures, and work on relevant algorithms and complexity questions.

What you will be able to do

• Understand and apply models of collective decision problems
• Analyze axiomatic properties of aggregation procedures
• Generalize formal proofs and algorithmic methods
• Compute outcomes of various Social-Choice functions
• Investigate the algorithmic complexity of procedures

What the module consists of

• LectureIntroduction to problems of social choice, formal modeling and axiomatic description
• Homeworks / Problem SetsDeepening lecture content through independent solving of exercises; contribution to grade improvement possible
• Exercise / Discussion SessionsDiscussion and solution of exercises, opportunity for questions and in-depth work

Teaching method

• LectureConveying the models, axioms and mathematical results
• Homework / Problem SetsConsolidation of what is learned through independent practice; partly graded
• Exercise / Discussion SessionsDiscussion of solutions and deepening the applications