DSS
Decision Sciences & Systems
Technical University of Munich
 

Florian Brandl, Johannes Hofbauer, Christian Saile, Christian Stricker, and Prof. Dr. Felix Brandt 

Proseminar SS 2016

Computational Social Choice

 

Content

Social choice theory is the field that studies the aggregation of individual preferences towards a collective choice. This seminar is based on the brand-new Handbook of Computational Social Choice, which will appear soon and which will be available for download for participants of the seminar. The book is divided into four parts that correspond to three major focus areas of computational social choice, plus a part for additional topics.

Part 1: Voting. This part will consist of roughly half the book, and will cover work on computational aspects of voting, including an introduction to different families of voting rules and the computational complexity of computing the winners; the computational complexity of manipulation in elections, and related strategic behavior; the alternative computational approaches that were studied for the analysis of voting rules, such as communication complexity; and voting with rich combinatorial preferences. 

Part 2: Fair division. Computational fair division is a subfield of computational social choice that deals with allocating goods to individuals with heterogeneous preferences in a socially desirable way. We will make the distinction between divisible and indivisible goods. The corresponding chapters will focus on issues related to complexity and optimization. 

Part 3: Coalition formation. A third subfield of computational social choice deals with different interpretations of the process of coalition formation when players have preferences over different coalitions. This includes matching (to form coalitions of size two), hedonic games (where coalitions are created based on the preferences of individuals), and weighted voting games (where coalitions emerge to achieve some goal, such as passing a bill in parliament).

Part 4: Additional topics. This part will include topics that have been studied by the computational social choice community, but did not find a home in previous parts: judgement aggregation, ranking systems, and knockout tournaments.

For a brief and general introduction to computational social choice see, e.g., here.

Registration (*please read carefully*)

All interested students have to send an application by email briefly describing their background (including study program, current semester, previous relevant courses) and motivation (up to 250 words). If desired, you may also include topics that you are interested in (not mandatory). Deadline for applications: March 13, 2016 (11:59 pm). Students from computer science additionally have to use the matching system for indication of interest. Notifications will be sent out as soon as the matching is completed and include further information on the assignment of topics and supervisors. Registration in TUMonline will be taken care of by the lecturers; no further action is required.

Time and venue

First meeting:

  • Wednesday, April 13, 14.00 - 16.00, room 01.10.033

Talks:

  • Wednesday, May 4, 14.00 - 17.00, room 01.10.033
    • Talk 1
      Speaker: Roman
      Session chair: Maximilian
      Chapter 2: W. S. Zwicker. Introduction to the theory of voting.
  • Talk 2
    Speaker: Alexander
    Session chair: Quentin
    Chapter 6: V. Conitzer and T. Walsh. Barriers to manipulation in voting.
 
  • Wednesday, May 11, 14.00 - 17.00, room 01.10.033
    • Talk 3
      Speaker: Öznur
      Session chair: Simon
      Chapter 12: S. Bouveret, Y. Chevaleyre, and N. Maudet. Fair allocation of indivisible goods.
    • Talk 4
      Speaker: Maximilian
      Session chair: Julian
      Chapter 13: A. D. Procaccia. Cake cutting algorithms.
 
  • Wednesday, June 1, 14.00 - 17.00room 01.10.033
    • Talk 5
      Speaker: Quentin
      Session chair: Roman
      Chapter 8: E. Elkind and A. Slinko. Rationalizations of voting rules.
    • Talk 6
      Speaker: Simon
      Session chair: Alexander
      Chapter 15: H. Aziz and R. Savani. Hedonic games.
 
  • WednesdayJune 8, 14.00 - 17.00, room 01.10.033
    • Talk 7
      Speaker: Julian
      Session chair: Öznur
      Chapter 16: G. Chalkiadakis and M. Wooldridge. Weighted voting games.

Preliminary selection of book chapters

  • Chapter 2: W. S. Zwicker. Introduction to the theory of voting. (2 students)
  • Chapter 3: F. Brandt, M. Brill, and P. Harrenstein. Tournament solutions.
  • Chapter 6: V. Conitzer and T. Walsh. Barriers to manipulation in voting.
  • Chapter 8: E. Elkind and A. Slinko. Rationalizations of voting rules.
  • Chapter 12: S. Bouveret, Y. Chevaleyre, and N. Maudet. Fair allocation of indivisible goods.
  • Chapter 13: A. D. Procaccia. Cake cutting algorithms.
  • Chapter 14: B. Klaus, D. Manlove, and F. Rossi. Matching under preferences.
  • Chapter 15: H. Aziz and R. Savani. Hedonic games.
  • Chapter 16: G. Chalkiadakis and M. Wooldridge. Weighted voting games.

Other resources

  • Feedback guidelines (1) (2) [in addition to what is presented during the first meeting]

Practicalities 

  • The seminar will be held in English (i.e., all presentations will have to be in English, too)

Module-Codes

  • IN0013 (Proseminar in the Bachelor programs Informatik, Wirtschaftsinformatik)

Contact

Florian Brandl
Johannes Hofbauer

Decision Sciences & Systems (DSS), Department of Informatics (I18), Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany
©2002-2017 DSS All Rights Reserved
Impressum, Privacy Policy, Copyright Information and Disclaimer