Voting Experiments: Measuring Vulnerability of Voting Procedures to Manipulation

Jan Palguta

Czech Economic Review, 2011, vol. 5, issue 3, 324-345

Abstract: 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.

Keywords: Voting; manipulation; information; computation-based simulations (search for similar items in EconPapers)
JEL-codes: C72 D72 D81 (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://auco.cuni.cz/mag/article/download/id/119/type/attachment (application/pdf)

Related works:
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:fau:aucocz:au2011_324

Ordering information: This journal article can be ordered from
http://auco.cuni.cz/

Access Statistics for this article

More articles in Czech Economic Review from Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies Contact information at EDIRC.
Bibliographic data for series maintained by Lenka Stastna ().