Advanced Search
MyIDEAS: Login

Minimal manipulability: anonymity and unanimity

Contents:

Author Info

  • Stefan Maus

    ()

  • Hans Peters

    ()

  • Ton Storcken

    ()

Abstract

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We conjecture that these examples are in fact all minimally manipulable social choice functions. Since some of these examples are even Pareto optimal, we have also derived the lower bound for Pareto optimal and anonymous social choice functions. Some of the minimally manipulable Pareto optimal and anonymous social choice functions can be interpreted as status quo voting.

(This abstract was borrowed from another version of this item.)

Download Info

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.
File URL: http://hdl.handle.net/10.1007/s00355-006-0202-3
Download Restriction: Access to full text is restricted to subscribers.

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.

Bibliographic Info

Article provided by Springer in its journal Social Choice and Welfare.

Volume (Year): 29 (2007)
Issue (Month): 2 (September)
Pages: 247-269

as in new window
Handle: RePEc:spr:sochwe:v:29:y:2007:i:2:p:247-269

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

Related research

Keywords:

Other versions of this item:

References

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.:
as in new window
  1. 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).
  2. Maus,Stefan & Peters,Hans & Storcken,Ton, 2005. "Anonymous voting and minimal manipulability," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  3. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
  4. Maus,Stefan & Peters,Hans & Storcken,Ton, 2005. "Anonymous voting and minimal manipulability," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Discussion Paper Series dp481, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  2. Andersson, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Working Papers 2010:16, Lund University, Department of Economics, revised 15 Jan 2013.
  3. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2012. "Least Manipulable Envy-free Rules in Economies with Indivisibilities," Working Papers 2012:8, Lund University, Department of Economics, revised 30 Sep 2013.
  4. Mostapha Diss, 2013. "Strategic manipulability of self-selective social choice rules," Working Papers 1302, Groupe d'Analyse et de Théorie Economique (GATE), Centre national de la recherche scientifique (CNRS), Université Lyon 2, Ecole Normale Supérieure.
  5. ANDERSSON, Tommy & EHLERS, Lars, 2013. "An algorithm for identifying agent-k-linked allocations in economies with indivisibilities," Cahiers de recherche 2013-12, Universite de Montreal, Departement de sciences economiques.
  6. Mostapha Diss, 2013. "Strategic manipulability of self-­selective social choice rules," Working Papers halshs-00785366, HAL.
  7. Wonki Jo Cho, 2013. "Impossibility Results for Parametrized Notions of Efficiency and Strategyproofness in Exchange Economies," The School of Economics Discussion Paper Series 1314, Economics, The University of Manchester.
  8. Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson, 2012. "(Minimally) ?-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 04-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:29:y:2007:i:2:p:247-269. 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: (Guenther Eichhorn) or (Christopher F Baum).

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.