The Computational Complexity of Random Serial Dictatorship

  • Haris Aziz
  • Felix Brandt
  • Markus Brill
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8289)

Abstract

In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random serial dictatorship (RSD) is a well-known generalization of random dictatorship that retains both properties. RSD has been particularly successful in the special domain of random assignment where indifferences are unavoidable. While executingRSD is obviously feasible, we show that computing the resulting probabilities is #P-complete and thus intractable, both in the context of voting and assignment.

References

  1. 1.
    Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Economics Letters (forthcoming, 2013)Google Scholar
  2. 2.
    Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory 100(2), 295–328 (2001)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Gibbard, A.: Manipulation of schemes that mix voting with chance. Econometrica 45(3), 665–681 (1977)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Sönmez, T., Ünver, M.U.: Matching, allocation, and exchange of discrete resources. In: Benhabib, J., Jackson, M.O., Bisin, A. (eds.) Handbook of Social Economics, vol. 1, ch. 17, pp. 781–852. Elsevier (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Haris Aziz
    • 1
  • Felix Brandt
    • 2
  • Markus Brill
    • 2
  1. 1.NICTA and UNSWSydneyAustralia
  2. 2.Technische Universität MünchenMünchenGermany

Personalised recommendations