Multi-stage voting, sequential elimination and Condorcet consistency
A class of voting procedures based on repeated ballots and elimination of one candidate in each round is shown to always induce an outcome in the top cycle and is thus Condorcet consistent, when voters behave strategically. This is an important class as it covers multi-stage, sequential elimination extensions of all standard one-shot voting rules (with the exception of negative voting), the same one-shot rules that would fail Condorcet consistency. The necessity of repeated ballots and sequential elimination are demonstrated by further showing that Condorcet consistency would fail in all standard voting rules that violate one or both of these conditions.
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.
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.:
- Moulin, Herve, 1980. "Implementing efficient, anonymous and neutral social choice functions," Journal of Mathematical Economics, Elsevier, vol. 7(3), pages 249-269, December.
- B. Douglas Bernheim & Antonio Rangel & Luis Rayo, 2006. "The Power of the Last Word in Legislative Policy Making," Econometrica, Econometric Society, vol. 74(5), pages 1161-1190, 09.
- Dhillon, A. & Lockwood, B., 1999.
"When are Plurality Rule Voting Games Dominance-Solvable?,"
The Warwick Economics Research Paper Series (TWERPS)
549, University of Warwick, Department of Economics.
- Dhillon, Amrita & Lockwood, Ben, 2004. "When are plurality rule voting games dominance-solvable?," Games and Economic Behavior, Elsevier, vol. 46(1), pages 55-75, January.
- Douglas Gale & Hamid Sabourian, 2005. "Complexity and Competition," Econometrica, Econometric Society, vol. 73(3), pages 739-769, 05.
- Kalyan Chatterjee & Hamid Sabourian, 1998.
"Multiperson Bargaining and Strategic Complexity,"
CRIEFF Discussion Papers
9808, Centre for Research into Industry, Enterprise, Finance and the Firm.
- Strumpf, Koleman S, 2002. " Strategic Competition in Sequential Election Contests," Public Choice, Springer, vol. 111(3-4), pages 377-97, June.
- Battaglini, Marco, 2005.
"Sequential voting with abstention,"
Games and Economic Behavior,
Elsevier, vol. 51(2), pages 445-463, May.
- Moulin, Herve, 1979. "Dominance Solvable Voting Schemes," Econometrica, Econometric Society, vol. 47(6), pages 1137-51, November.
- McKelvey, Richard D. & Niemi, Richard G., 1978. "A multistage game representation of sophisticated voting for binary procedures," Journal of Economic Theory, Elsevier, vol. 18(1), pages 1-22, June.
- Maskin, Eric, 1999.
"Nash Equilibrium and Welfare Optimality,"
Review of Economic Studies,
Wiley Blackwell, vol. 66(1), pages 23-38, January.
- Eric Maskin, 1998. "Nash Equilibrium and Welfare Optimality," Harvard Institute of Economic Research Working Papers 1829, Harvard - Institute of Economic Research.
- Sabourian, Hamid, 2004. "Bargaining and markets: complexity and the competitive outcome," Journal of Economic Theory, Elsevier, vol. 116(2), pages 189-228, June.
- Francesco Sinopoli & Bhaskar Dutta & Jean-François Laslier, 2006. "Approval voting: three examples," International Journal of Game Theory, Springer, vol. 35(1), pages 27-38, December.
- Dutta, Bhaskar & Jackson, Matthew O. & Le Breton, Michel, 2002. "Voting by Successive Elimination and Strategic Candidacy," Journal of Economic Theory, Elsevier, vol. 103(1), pages 190-218, March.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:144:y:2009:i:3:p:1278-1299. 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: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.