Abstract
In this last chapter, we take up a quite different topic. One desirable property of a social choice rule is that it not be overly sensitive to mistakes. For mistakes are certain to occur. Wishing to honestly record your true preference ordering, you may write it down incorrectly, pull the wrong lever or type in the wrong symbol. The machine may electronically erroneously transpose alternatives in your ordering or incorrectly add up a Borda count. Since this will sometimes happen, you want to design around it. You want to design a rule that is not so sensitive that the outcome will be drastically altered by small mistakes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
The Chichilnisky theorem can be found in “Social Aggregation Rules and Continuity, ” Quarterly Journal of Economics (May, 1982) pp. 337–352.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kelly, J.S. (1988). Mistakes. In: Social Choice Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09925-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-09925-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-09927-8
Online ISBN: 978-3-662-09925-4
eBook Packages: Springer Book Archive