IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v63y2024i1d10.1007_s00355-024-01523-4.html
   My bibliography  Save this article

Group strategy-proof rules in multidimensional binary domains

Author

Listed:
  • Aditya Aradhye

    (Tel Aviv University)

  • Hans Peters

    (Maastricht University)

Abstract

We consider a setting in which the alternatives are binary vectors and the preferences of the agents are determined by the Hamming distance from their most preferred alternatives. We consider only rules that are unanimous, anonymous, and component-neutral, and focus on strategy-proofness, weak group strategy-proofness, and strong group strategy-proofness. We show that component-wise majority rules are strategy-proof, and for three agents or two components also weakly group strategy-proof, but not otherwise. These rules are even strongly group strategy-proof if there are two or three agents. Our main result is an impossibility result: if there are at least four agents and at least three components, then no rule is strongly group strategy-proof.

Suggested Citation

  • Aditya Aradhye & Hans Peters, 2024. "Group strategy-proof rules in multidimensional binary domains," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 103-124, August.
  • Handle: RePEc:spr:sochwe:v:63:y:2024:i:1:d:10.1007_s00355-024-01523-4
    DOI: 10.1007/s00355-024-01523-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00355-024-01523-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00355-024-01523-4?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Riker, William H. & Brams, Steven J., 1973. "The Paradox of Vote Trading," American Political Science Review, Cambridge University Press, vol. 67(4), pages 1235-1247, December.
    2. Dietrich, Franz & List, Christian, 2007. "Strategy-Proof Judgment Aggregation," Economics and Philosophy, Cambridge University Press, vol. 23(3), pages 269-300, November.
    3. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2010. "Individual versus group strategy-proofness: When do they coincide?," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1648-1674, September.
    4. Zoi Terzopoulou & Ulle Endriss, 2019. "Strategyproof judgment aggregation under partial information," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(3), pages 415-442, October.
    5. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
    6. Steven Brams & D. Kilgour & M. Sanver, 2007. "A minimax procedure for electing committees," Public Choice, Springer, vol. 132(3), pages 401-420, September.
    7. Hans Peters & Souvik Roy & Soumyarup Sadhukhan, 2021. "Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 811-833, May.
    8. Schummer, James & Vohra, Rakesh V., 2002. "Strategy-proof Location on a Network," Journal of Economic Theory, Elsevier, vol. 104(2), pages 405-428, June.
    9. Elad Dokow & Ron Holzman, 2009. "Aggregation of binary evaluations for truth-functional agendas," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(2), pages 221-241, February.
    10. 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. Michel Breton & Vera Zaporozhets, 2009. "On the equivalence of coalitional and individual strategy-proofness properties," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(2), pages 287-309, August.
    2. Alcalde-Unzu, Jorge & Vorsatz, Marc, 2018. "Strategy-proof location of public facilities," Games and Economic Behavior, Elsevier, vol. 112(C), pages 21-48.
    3. Roy, Souvik & Sadhukhan, Soumyarup, 2021. "A unified characterization of the randomized strategy-proof rules," Journal of Economic Theory, Elsevier, vol. 197(C).
    4. Achuthankutty, Gopakumar & Roy, Souvik, 2017. "On Top-connected Single-peaked and Partially Single-peaked Domains," MPRA Paper 78102, University Library of Munich, Germany.
    5. Gopakumar Achuthankutty & Souvik Roy, 2018. "On single-peaked domains and min–max rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(4), pages 753-772, December.
    6. Achuthankutty, Gopakumar & Roy, Souvik, 2017. "Strategy-proof Rules on Partially Single-peaked Domains," MPRA Paper 82267, University Library of Munich, Germany.
    7. Haris Aziz & Alexander Lam & Barton E. Lee & Toby Walsh, 2021. "Strategyproof and Proportionally Fair Facility Location," Papers 2111.01566, arXiv.org, revised Nov 2023.
    8. Reffgen, Alexander, 2015. "Strategy-proof social choice on multiple and multi-dimensional single-peaked domains," Journal of Economic Theory, Elsevier, vol. 157(C), pages 349-383.
    9. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2010. "Individual versus group strategy-proofness: When do they coincide?," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1648-1674, September.
    10. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2020. "Arrow on domain conditions: a fruitful road to travel," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(2), pages 237-258, March.
    11. Chatterji, Shurojit & Zeng, Huaxia, 2023. "A taxonomy of non-dictatorial unidimensional domains," Games and Economic Behavior, Elsevier, vol. 137(C), pages 228-269.
    12. Bossert, Walter & Sprumont, Yves, 2014. "Strategy-proof preference aggregation: Possibilities and characterizations," Games and Economic Behavior, Elsevier, vol. 85(C), pages 109-126.
    13. Haeringer, Guillaume & Hałaburda, Hanna, 2016. "Monotone strategyproofness," Games and Economic Behavior, Elsevier, vol. 98(C), pages 68-77.
    14. William Thomson, 2023. "Where should your daughter go to college? An axiomatic analysis," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 313-330, January.
    15. 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.
    16. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2012. "Two necessary conditions for strategy-proofness: On what domains are they also sufficient?," Games and Economic Behavior, Elsevier, vol. 75(2), pages 490-509.
    17. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2012. "Domains, ranges and strategy-proofness: the case of single-dipped preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 335-352, July.
    18. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2022. "Restricted environments and incentive compatibility in interdependent values models," Games and Economic Behavior, Elsevier, vol. 131(C), pages 1-28.
    19. Grisel Ayllón & Diego M. Caramuta, 2016. "Single-dipped preferences with satiation: strong group strategy-proofness and unanimity," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(2), pages 245-264, August.
    20. , & , & ,, 2007. "Secure implementation," Theoretical Economics, Econometric Society, vol. 2(3), 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:63:y:2024:i:1:d:10.1007_s00355-024-01523-4. 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.