Candidate stability and nonbinary social choice
Lars Ehlers and
John Weymark
Economic Theory, 2003, vol. 22, issue 2, 233-243
Abstract:
The requirement that a voting procedure be immune to the strategic withdrawal of a candidate for election can be formalized in different ways. Dutta, Jackson, and Le Breton (Econometrica, 2001) have recently shown that two formalizations of this candidate stability property are incompatible with some other desirable properties of voting procedures. This article shows that Grether and Plott's nonbinary generalization of Arrow's Theorem can be used to provide simple proofs of two of their impossibility theorems. Copyright Springer-Verlag Berlin Heidelberg 2003
Keywords: Keywords and Phrases:Axiomatic social choice; Candidate stability; Political economy; Voting.; JEL Classification Numbers:D71; D72. (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (14)
Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-002-0279-6 (text/html)
Access to full text is restricted to subscribers.
Related works:
Working Paper: Candidate Stability and Nonbinary Social Choice (2001) 
Working Paper: Candidate Stability and Nonbinary Social Choice (2001) 
Working Paper: Candidate Stability and Nonbinary Social Choice (2001) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:22:y:2003:i:2:p:233-243
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2
DOI: 10.1007/s00199-002-0279-6
Access Statistics for this article
Economic Theory is currently edited by Nichoals Yanneils
More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().