IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v29y2007i2p247-269.html
   My bibliography  Save this article

Minimal manipulability: anonymity and unanimity

Author

Listed:
  • 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.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was b
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • 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.
    • Handle: RePEc:spr:sochwe:v:29:y:2007:i:2:p:247-269
    DOI: 10.1007/s00355-006-0202-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00355-006-0202-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00355-006-0202-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Lok, R.B. & Romero Morales, D. & Vermeulen, A.J., 2005. "The agents-are-substitutes property in continuous generalized assignment problems," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. 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.
    3. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Minimal manipulability: Unanimity and nondictatorship," Journal of Mathematical Economics, Elsevier, vol. 43(6), pages 675-691, August.
    4. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    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


    Cited by:

    1. , & , & ,, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
    2. Cho, Wonki Jo, 2014. "Impossibility results for parametrized notions of efficiency and strategy-proofness in exchange economies," Games and Economic Behavior, Elsevier, vol. 86(C), pages 26-39.
    3. Lok, R.B. & Romero Morales, D. & Vermeulen, A.J., 2005. "The agents-are-substitutes property in continuous generalized assignment problems," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Tommy Andersson & Lars Ehlers, 2022. "An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 50-60, March.
    5. Mostapha Diss, 2015. "Strategic manipulability of self-selective social choice rules," Annals of Operations Research, Springer, vol. 229(1), pages 347-376, June.
    6. Fujinaka, Yuji & Wakayama, Takuma, 2015. "Maximal manipulation of envy-free solutions in economies with indivisible goods and money," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 165-185.
    7. Bednay, Dezső & Moskalenko, Anna & Tasnádi, Attila, 2019. "Dictatorship versus manipulability," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 72-76.
    8. Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Levine's Working Paper Archive 122247000000002416, David K. Levine.
    9. Tommy ANDERSSON & Lars EHLERS, 2013. "An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities," Cahiers de recherche 17-2013, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    10. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Anonymous voting and minimal manipulability," Journal of Economic Theory, Elsevier, vol. 135(1), pages 533-544, July.
    11. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014. "Least manipulable Envy-free rules in economies with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 69(C), pages 43-49.
    12. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2012. "(Minimally) 'epsilon'-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 2012-03, Universite de Montreal, Departement de sciences economiques.
    13. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Anonymous voting and minimal manipulability," Journal of Economic Theory, Elsevier, vol. 135(1), pages 533-544, July.
    2. Bednay, Dezső & Moskalenko, Anna & Tasnádi, Attila, 2019. "Dictatorship versus manipulability," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 72-76.
    3. Hans Peters & Souvik Roy & Ton Storcken, 2012. "On the manipulability of approval voting and related scoring rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 399-429, July.
    4. Lok, R.B. & Romero Morales, D. & Vermeulen, A.J., 2005. "The agents-are-substitutes property in continuous generalized assignment problems," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Donald Campbell & Jerry Kelly, 2009. "Gains from manipulating social choice rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(3), pages 349-371, September.
    6. Yuliya A. Veselova, 2020. "Does Incomplete Information Reduce Manipulability?," Group Decision and Negotiation, Springer, vol. 29(3), pages 523-548, June.
    7. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Minimal manipulability: Unanimity and nondictatorship," Journal of Mathematical Economics, Elsevier, vol. 43(6), pages 675-691, August.
    8. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Minimally manipulable anonymous social choice functions," Mathematical Social Sciences, Elsevier, vol. 53(3), pages 239-254, May.
    9. 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.
    10. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    11. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    12. Lirong Xia, 2020. "How Likely Are Large Elections Tied?," Papers 2011.03791, arXiv.org, revised Jul 2021.
    13. Barbera, S. & Bossert, W. & Pattanaik, P.K., 2001. "Ranking Sets of Objects," Cahiers de recherche 2001-02, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    14. Shinji Ohseto, 2006. "Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 111-121, September.
    15. Jeff Strnad, 2024. "Economic DAO Governance: A Contestable Control Approach," Papers 2403.16980, arXiv.org, revised May 2024.
    16. Franz Dietrich & Christian List, 2024. "The impossibility of non-manipulable probability aggregation," Documents de travail du Centre d'Economie de la Sorbonne 24001, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    17. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    18. Samet, Dov & Schmeidler, David, 2003. "Between liberalism and democracy," Journal of Economic Theory, Elsevier, vol. 110(2), pages 213-233, June.
    19. Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
    20. Bruno Frey, 2011. "Tullock challenges: happiness, revolutions, and democracy," Public Choice, Springer, vol. 148(3), pages 269-281, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:spr:sochwe:v:29:y:2007:i:2:p:247-269. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.