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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Economics Letters (forthcoming, 2013)
Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory 100(2), 295–328 (2001)
Gibbard, A.: Manipulation of schemes that mix voting with chance. Econometrica 45(3), 665–681 (1977)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)