Skip to main content

The Computational Complexity of Random Serial Dictatorship

  • Conference paper
Web and Internet Economics (WINE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8289))

Included in the following conference series:

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 executing RSD is obviously feasible, we show that computing the resulting probabilities is #P-complete and thus intractable, both in the context of voting and assignment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Economics Letters (forthcoming, 2013)

    Google Scholar 

  2. Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory 100(2), 295–328 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gibbard, A.: Manipulation of schemes that mix voting with chance. Econometrica 45(3), 665–681 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aziz, H., Brandt, F., Brill, M. (2013). The Computational Complexity of Random Serial Dictatorship. In: Chen, Y., Immorlica, N. (eds) Web and Internet Economics. WINE 2013. Lecture Notes in Computer Science, vol 8289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45046-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45046-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45045-7

  • Online ISBN: 978-3-642-45046-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics