Computational Social Choice and Complexity Theory
ESSLLI—August 13–17, 2018

Lecturer: Ronald de Haan (me@ronalddehaan.eu)

 

If you are interested in a PhD or PostDoc position in Computational Social Choice at the University of Amsterdam, talk to me!

 

Day 1: Introduction, Voting, Complexity

Material:

Day 2: Parameterized Complexity, Strategic Behavior in Voting

Material:

Day 3: Bribery in Voting, Domain Restrictions

Material:

Day 4: Judgment Aggregation

Material:

Day 5: Stable Matching

Material:

 

Literature

[1] Computational Complexity: A Modern Approach. Sanjeev Arora and Boaz Barak, 2009.
[2] Computers and Intractability: A Guide to the Theory of NP-completeness. Michael Garey and David Johnson, 1979.
[3] Handbook of Computational Social Choice. Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia (eds), 2016.
[4] Trends in Computational Social Choice. Ulle Endriss (ed), 2017.
[5] Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Jörg Rothe (ed), 2016.
[6] Studies in Computational Aspects of Voting. Nadja Betzler, Robert Bredereck, Jiehua Chen, and Rolf Niedermeier. In: The Multivariate Algorithmic Revolution and Beyond. Hans Bodlaender, Rod Downey, Fedor Fomin, and Dániel Marx (eds), 2012.
[7] P, NP, and NP-Completeness: The Basics of Computational Complexity. Oded Goldreich, 2010.