A voting procedure is candidate stable if no candidate would prefer to withdraw from an election when all of the other potential candidates enter. Dutta, Jackson, and Le Breton have recently established a number of theorems showing that candidate stability is 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 a simple proof of Dutta, Jackson, and Le Breton's impossibility theorem for the case in which the voters and potential candidates have no one in common.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Department of Economics, Vanderbilt University in its series Working Papers with number
0029.
Find related papers by JEL classification: D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Models of Political Processes: Rent-seeking, Elections, Legislatures, and Voting Behavior
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)