Anonymous voting and minimal manipulability
We compare the manipulability of different choice rules by considering the number of manipulable profiles. We establish the minimal number of such profiles for tops-only, anonymous, and surjective choice rules, and show that this number is attained by unanimity rules with status quo.
(This abstract was borrowed from another version of this item.)
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.:
- 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).
- Maus,Stefan & Peters,Hans & Storcken,Ton, 2004.
"Minimal Manipulability: Anonymity and Unanimity,"
026, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Gibbard, Allan, 1978. "Straightforwardness of Game Forms with Lotteries as Outcomes," Econometrica, Econometric Society, vol. 46(3), pages 595-614, May.
- Peter Fristrup & Hans Keiding, 1998. "Minimal manipulability and interjacency for two-person social choice functions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 15(3), pages 455-467.
- Dutta, Bhaskar, 1980. "Strategic Voting in a Probabilistic Framework," Econometrica, Econometric Society, vol. 48(2), pages 447-56, March.
- Maus,Stefan & Peters,Hans & Storcken,Ton, 2004. "Minimal Manipulability: Anonymity and Surjectivity," Research Memorandum 006, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- Prasanta K. Pattanaik, 1976. "Counter-threats and Strategic Manipulation under Voting Schemes," Review of Economic Studies, Oxford University Press, vol. 43(1), pages 11-18.
- Kim, K.H. & Roush, F.W., 1984. "Nonmanipulability in two dimensions," Mathematical Social Sciences, Elsevier, vol. 8(1), pages 29-43, August.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
- Pattanaik, Prasanta K, 1976. "Threats, Counter-Threats, and Strategic Voting," Econometrica, Econometric Society, vol. 44(1), pages 91-103, January.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:135:y:2007:i:1:p:533-544. 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: (Shamier, Wendy)
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.