This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Elections Can be Manipulated Often

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ehud Friedgut
Gil Kalai
Noam Nisan
Abstract

The Gibbard-Satterthwaite theorem states that every non-trivial voting method between at least 3 alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random manipulation by a single random voter will succeed with non-negligible probability for every neutral voting method between 3 alternatives that is far from being a dictatorship.

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.

File URL: http://ratio.huji.ac.il/dp/dp481.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp481.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 16 pages
Date of creation: Apr 2008
Date of revision:
Handle: RePEc:huj:dispap:dp481

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ron Peretz).

Related research
Keywords:

This paper has been announced in the following NEP Reports:

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.:
  1. Maus,Stefan & Peters,Hans & Storcken,Ton, 2004. "Minimal Manipulability: Anonymity and Unanimity," Research Memoranda 026, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization. [Downloadable!]
  2. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July. [Downloadable!] (restricted)
  3. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? IDEAS uses the data collected within the RePEc project, the largest online bibliographic database in Economics.

This page was last updated on 2009-12-26.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.