Voting Experiments: Measuring Vulnerability of Voting Procedures to Manipulation
A minimal reduction in strategic voter’s knowledge about other voters’ voting patterns severely limits her ability to strategically manipulate the voting outcome. In this paper I relax the implicit assumption made in the Gibbard-Satterthwaite’s impossibility theorem about strategic voter‘s complete information about all other voters’ preference profiles. Via a series of computation-based simulations I find that vulnerability to strategic voting is decreasing in the number of voters and increasing in the number of alternatives. Least vulnerable voting procedures are Condorcet-consistent procedures, followed by elimination procedures, while most prone to manipulation are the simplest rules. Strategic voting is vulnerable both to an absolute and relative reduction in amount of information.
Volume (Year): 5 (2011)
Issue (Month): 3 (November)
|Contact details of provider:|| Postal: Opletalova 26, CZ-110 00 Prague|
Phone: +420 2 222112330
Fax: +420 2 22112304
Web page: http://ies.fsv.cuni.cz/
More information through EDIRC
|Order Information:|| Web: http://auco.cuni.cz/ Email: |
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.:
- Carmelo Rodríguez-Álvarez, 2007. "On the manipulation of social choice correspondences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(2), pages 175-199, September.
- Alvarez, R. Michael & Nagler, Jonathan, 2000. "A New Approach for Modelling Strategic Voting in Multiparty Elections," British Journal of Political Science, Cambridge University Press, vol. 30(01), pages 57-75, January.
- Barbera, Salvador & Dutta, Bhaskar & Sen, Arunava, 2005.
"Corrigendum to "Strategy-proof social choice correspondences" [J. Econ. Theory 101 (2001) 374-394],"
Journal of Economic Theory,
Elsevier, vol. 120(2), pages 275-275, February.
- Barbera, Salvador & Dutta, Bhaskar & Sen, Arunava, 2001. "Strategy-proof Social Choice Correspondences," Journal of Economic Theory, Elsevier, vol. 101(2), pages 374-394, December.
- Jean-François Laslier, 2009. "In Silico Voting Experiments," Working Papers hal-00390376, HAL.
- Masashi Umezawa, 2009. "Coalitionally strategy-proof social choice correspondences and the Pareto rule," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(1), pages 151-158, June.
- Conal Duddy & Juan Perote-Pena & Asjley Piggins, 2009. "Manipulating an ordering," Working Papers 0141, National University of Ireland Galway, Department of Economics, revised 2009.
- Aaron Edlin & Andrew Gelman & Noah Kaplan, 2007. "Voting as a Rational Choice: Why and How People Vote to Improve the Well-Being of Others," NBER Working Papers 13562, National Bureau of Economic Research, Inc.
- Pattanaik, Prasanta K., 1973. "On the stability of sincere voting situations," Journal of Economic Theory, Elsevier, vol. 6(6), pages 558-574, December.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:fau:aucocz:au2011_324. 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: (Lenka Stastna)
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.