• Jerry S. Kelly


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.


Distance Function Choice Function Output Error Weak Order Strict Preference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

  1. The Chichilnisky theorem can be found in “Social Aggregation Rules and Continuity, ” Quarterly Journal of Economics (May, 1982) pp. 337–352.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jerry S. Kelly
    • 1
  1. 1.Department of EconomicsSyracuse UniversitySyracuseUSA

Personalised recommendations