Elections Can be Manipulated Often
Download full text from publisher
Other versions of this item:
- Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Levine's Working Paper Archive 122247000000002121, David K. Levine.
- Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Levine's Working Paper Archive 122247000000002416, David K. Levine.
References listed on IDEAS
- Stefan Maus & Hans Peters & Ton Storcken, 2007. "Minimal manipulability: anonymity and unanimity," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(2), pages 247-269, September.
- 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.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
More about this item
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2008-04-21 (All new papers)
- NEP-CDM-2008-04-21 (Collective Decision-Making)
- NEP-POL-2008-04-21 (Positive Political Economics)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp481. 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: (Michael Simkin). General contact details of provider: http://edirc.repec.org/data/crihuil.html .