On the manipulability of approval voting and related scoring rules
AbstractWe characterize all preference profiles at which the approval (voting) rule is manipulable, under three extensions of preferences to sets of alternatives: by comparison of worstalternatives, best alternatives, or by comparison based on stochastic dominance. We perform a similar exercise for $k$-approval rules, where voters approve of a fixed number $k$ of alternatives. These results can be used to compare ($k$-)approval rules with respect to their manipulability. Analytical results are obtained for the case of two voters, specifically, the values of $k$ for which the $k$-approval rule is minimally manipulable -- has the smallest number of manipulable preference profiles -- under the various preference extensions are determined. For the number of voters going to infinity, an asymptotic result is that the $k$-approval rule with $k$ around half the number of alternatives is minimally manipulable among all scoring rules. Further results are obtained by simulation and indicate that $k$-approval rules may improve on the approval rule as far as manipulability is concerned.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 39 (2012)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
Other versions of this item:
- Peters Hans & Roy Souvik & Storcken Ton, 2009. "On the manipulability of approval voting and related scoring rules," Research Memorandum 060, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
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.:
- Gehrlein, William V. & Lepelley, Dominique, 1998. "The Condorcet efficiency of approval voting and the probability of electing the Condorcet loser," Journal of Mathematical Economics, Elsevier, vol. 29(3), pages 271-283, April.
- Maus, Stefan & Peters, Hans & Storcken, Ton, 2007.
"Minimal manipulability: Unanimity and nondictatorship,"
Journal of Mathematical Economics,
Elsevier, vol. 43(6), pages 675-691, August.
- Maus,Stefan & Peters,Hans & Storcken,Ton, 2004. "Minimal manipulability: Unanimity and Nondictatorship," Research Memorandum 005, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Pritchard, Geoffrey & Wilson, Mark C., 2009. "Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 35-57, July.
- Peter Fristrup & Hans Keiding, 1998. "Minimal manipulability and interjacency for two-person social choice functions," Social Choice and Welfare, Springer, vol. 15(3), pages 455-467.
- Donald Campbell & Jerry Kelly, 2009. "Gains from manipulating social choice rules," Economic Theory, Springer, vol. 40(3), pages 349-371, September.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- 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.
- Saari, Donald G, 1990. " Susceptibility to Manipulation," Public Choice, Springer, vol. 64(1), pages 21-41, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.