IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2503.02740.html
   My bibliography  Save this paper

On voting rules satisfying false-name-proofness and participation

Author

Listed:
  • Agustin G. Bonifacio
  • Federico Fioravanti

Abstract

We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are called false-name-proofness and participation, respectively. For the universal domain of (strict) preferences, these properties together imply anonymity and are incompatible with neutrality. For the domain of preferences defined over all subsets of a given set of objects, both of these properties cannot be met by onto and object neutral rules that also satisfy the tops-only criterion. However, when preferences over subsets of objects are restricted to be separable, all these properties can be satisfied. Furthermore, the domain of separable preferences is maximal for these properties.

Suggested Citation

  • Agustin G. Bonifacio & Federico Fioravanti, 2025. "On voting rules satisfying false-name-proofness and participation," Papers 2503.02740, arXiv.org.
    • Handle: RePEc:arx:papers:2503.02740
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2503.02740
    File Function: Latest version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Ching, Stephen & Serizawa, Shigehiro, 1998. "A Maximal Domain for the Existence of Strategy-Proof Rules," Journal of Economic Theory, Elsevier, vol. 78(1), pages 157-166, January.
    2. Yokoo, Makoto & Sakurai, Yuko & Matsubara, Shigeo, 2004. "The effect of false-name bids in combinatorial auctions: new fraud in internet auctions," Games and Economic Behavior, Elsevier, vol. 46(1), pages 174-188, January.
    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. Berga, Dolors & Serizawa, Shigehiro, 2000. "Maximal Domain for Strategy-Proof Rules with One Public Good," Journal of Economic Theory, Elsevier, vol. 90(1), pages 39-61, January.
    2. Takuma Wakayama, 2017. "Bribe-proofness for single-peaked preferences: characterizations and maximality-of-domains results," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 357-385, August.
    3. Bonifacio, Agustín G. & Massó, Jordi & Neme, Pablo, 2023. "Preference restrictions for simple and strategy-proof rules: Local and weakly single-peaked domains," Journal of Mathematical Economics, Elsevier, vol. 106(C).
    4. Paolo Giovanni Piacquadio, 2017. "A Fairness Justification of Utilitarianism," Econometrica, Econometric Society, vol. 85, pages 1261-1276, July.
    5. 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.
    6. Yotam Gafni & Moshe Tennenholtz, 2022. "Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions," Papers 2210.15181, arXiv.org, revised Jul 2023.
    7. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    8. Dirk Bergemann & Stephen Morris, 2012. "Robust Mechanism Design: An Introduction," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 1, pages 1-48, World Scientific Publishing Co. Pte. Ltd..
    9. Gustavo Bergantiños & Jordi Massó & Alejandro Neme, 2012. "The division problem with voluntary participation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 371-406, March.
    10. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    11. Lunander, Anders & Lundberg, Sofia, 2009. "Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts," Umeå Economic Studies 776, Umeå University, Department of Economics, revised 16 Sep 2009.
    12. Masso, Jordi & Neme, Alejandro, 2001. "Maximal Domain of Preferences in the Division Problem," Games and Economic Behavior, Elsevier, vol. 37(2), pages 367-387, November.
    13. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities : Vickrey Versus the Ausubel-Milgrom Proxy Auction," Working Papers 2007-26, Center for Research in Economics and Statistics.
    14. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    15. Federico Fioravanti & Jordi Massó, 2024. "False-name-proof and strategy-proof voting rules under separable preferences," Theory and Decision, Springer, vol. 97(2), pages 391-408, September.
    16. Arribillaga, R. Pablo & Massó, Jordi, 2016. "Comparing generalized median voter schemes according to their manipulability," Theoretical Economics, Econometric Society, vol. 11(2), May.
    17. Chatterji, Shurojit & Sanver, Remzi & Sen, Arunava, 2013. "On domains that admit well-behaved strategy-proof social choice functions," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1050-1073.
    18. Hideyuki Mizobuchi & Shigehiro Serizawa, 2006. "Maximal Domain for Strategy-proof Rules in Allotment Economies," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 27(1), pages 195-210, August.
    19. S. M. Reza Dibaj & Ali Miri & SeyedAkbar Mostafavi, 2020. "A cloud dynamic online double auction mechanism (DODAM) for sustainable pricing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(4), pages 461-480, December.
    20. Bonifacio Agustín Germán & Arribillaga Roberto Pablo, 2023. "Not obviously manipulable allotment rules," Asociación Argentina de Economía Política: Working Papers 4627, Asociación Argentina de Economía Política.

    More about this item

    JEL classification:

    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:arx:papers:2503.02740. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.