IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/80608.html
   My bibliography  Save this paper

How Borda voting rule can respect Arrow IIA and avoid Cloning manipulation

Author

Listed:
  • DOMBOU T., Dany R.

Abstract

This paper proposes a new formulation of the Borda rule in order to deal with the problem of cloning manipulation. This new Borda voting specification will be named: Dynamic Borda Voting (DBV) and it satisfies Arrow's IIA condition. The calculations, propositions with proof and explanations are made to show the effectiveness of this method. From DBV, the paper presents a method to measure and quantify the magnitude of the shock due to change in irrelevant alternatives over a scale moving from 0 to 100.

Suggested Citation

  • DOMBOU T., Dany R., 2017. "How Borda voting rule can respect Arrow IIA and avoid Cloning manipulation," MPRA Paper 80608, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:80608
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/80608/1/MPRA_paper_80608.pdf
    File Function: original version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/81980/10/1383-4820-1-PB.pdf
    File Function: revised version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Virginie Béhue & Pierre Favardin & Dominique Lepelley, 2009. "La manipulation stratégique des règles de vote : une étude expérimentale," Recherches économiques de Louvain, De Boeck Université, vol. 75(4), pages 503-516.
    2. Mostapha Diss & Abdelmonaim Tlidi, 2018. "Another perspective on Borda’s paradox," Theory and Decision, Springer, vol. 84(1), pages 99-121, January.
    3. Martin Barbie & Clemens Puppe & Attila Tasnádi, 2006. "Non-manipulable domains for the Borda count," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(2), pages 411-430, January.
    4. Aki Lehtinen, 2007. "The Borda rule is also intended for dishonest men," Public Choice, Springer, vol. 133(1), pages 73-90, October.
    5. Saari, Donald G. & McIntee, Tomas J., 2013. "Connecting pairwise and positional election outcomes," Mathematical Social Sciences, Elsevier, vol. 66(2), pages 140-151.
    6. Islam, Jamal & Mohajan, Haradhan & Moolio, Pahlaj, 2011. "Borda voting is non-manipulable but cloning manipulation is possible," MPRA Paper 50848, University Library of Munich, Germany, revised 10 Jan 2012.
    7. 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)

    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. Krzysztof Kontek & Honorata Sosnowska, 2020. "Specific Tastes or Cliques of Jurors? How to Reduce the Level of Manipulation in Group Decisions?," Group Decision and Negotiation, Springer, vol. 29(6), pages 1057-1084, December.
    2. Kentaro Hatsumi & Dolors Berga & Shigehiro Serizawa, 2014. "A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 153-168, February.
    3. Csóka, Péter & Kondor, Gábor, 2019. "Delegációk igazságos kiválasztása társadalmi választások elméletével [Choosing a fair delegation by social choice theory]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 771-787.
    4. M. Sanver & William Zwicker, 2012. "Monotonicity properties and their adaptation to irresolute social choice rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 371-398, July.
    5. Bandhu, Sarvesh & Mondal, Bishwajyoti & Pramanik, Anup, 2022. "Strategy-proofness of the unanimity with status-quo rule over restricted domains," Economics Letters, Elsevier, vol. 210(C).
    6. Christian Basteck, 2022. "Characterising scoring rules by their solution in iteratively undominated strategies," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 74(1), pages 161-208, July.
    7. M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 461-471, June.
    8. Sanver, M. Remzi, 2008. "Nash implementability of the plurality rule over restricted domains," Economics Letters, Elsevier, vol. 99(2), pages 298-300, May.
    9. Pongou, Roland & Tchantcho, Bertrand, 2021. "Round-robin political tournaments: Abstention, truthful equilibria, and effective power," Games and Economic Behavior, Elsevier, vol. 130(C), pages 331-351.
    10. Dezső Bednay & Attila Tasnádi & Sonal Yadav, 2022. "On the manipulability of a class of social choice functions: plurality kth rules," Review of Economic Design, Springer;Society for Economic Design, vol. 26(1), pages 127-148, March.
    11. Aki Lehtinen, 2011. "A welfarist critique of social choice theory," Journal of Theoretical Politics, , vol. 23(3), pages 359-381, July.
    12. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    13. 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.
    14. Lirong Xia, 2020. "How Likely Are Large Elections Tied?," Papers 2011.03791, arXiv.org, revised Jul 2021.
    15. 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.
    16. 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.
    17. Jeff Strnad, 2024. "Economic DAO Governance: A Contestable Control Approach," Papers 2403.16980, arXiv.org.
    18. 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.
    19. 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.
    20. Samet, Dov & Schmeidler, David, 2003. "Between liberalism and democracy," Journal of Economic Theory, Elsevier, vol. 110(2), pages 213-233, June.

    More about this item

    Keywords

    Voting rules; Arrow IIA; Cloning manipulation;
    All these keywords.

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • D7 - Microeconomics - - Analysis of Collective Decision-Making
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pra:mprapa:80608. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.