The Strong No Show Paradoxes are a common flaw in Condorcet voting correspondences
The No Show Paradox (there is a voter who would rather not vote) is known to affect every Condorcet voting function. This paper analyses two strong versions of this paradox in the context of Condorcet voting correspondences. The first says that there is a voter whose favorite candidate loses the election if she votes honestly, but gets elected if she abstains. The second says that there is a voter whose least preferred candidate gets elected if she votes honestly, but loses the election if she abstains. All Condorcet correspondences satisfying some weak domination properties are shown to be affected by these strong forms of the paradox. On the other hand, with the exception of the Simpson-Cramer Minmax and the Young rule, all the Condorcet correspondences that (to the best of our knowledge) are proposed in the literature suffer from these two paradoxes.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 18 (2001)
Issue (Month): 3 ()
|Note:||Received: 30 November 1999/Accepted: 27 March 2000|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:18:y:2001:i:3:p:601-616. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.