IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v150y2025icp27-33.html
   My bibliography  Save this article

Credibility of group manipulation in random assignments

Author

Listed:
  • Hosseinzadeh Ranjbar, Homa
  • Feizi, Mehdi

Abstract

For the random assignment problem, we introduce the notion of collusion-proofness that happens if the rule is immune to any collusion on misreporting preferences as it is either not profitable to form or profitable to betray. We characterize collusion-proofnessand prove that an assignment rule is collusion-proof if and only if it is strategy-proof and non-bossy. Therefore, the random serial dictatorship rule is immune to any collusive agreement between agents on preference misrepresentation, though it is not (weakly) group strategy-proof. This result gives us a possibility between collusion-proofness, ex-post Pareto efficiency, and equal treatment of equals. Furthermore, we proved that a large family of strategy-proof mechanisms called rank exchange mechanisms, à la Shende and Purohit (2023), are collusion-proof but group manipulable.

Suggested Citation

  • Hosseinzadeh Ranjbar, Homa & Feizi, Mehdi, 2025. "Credibility of group manipulation in random assignments," Games and Economic Behavior, Elsevier, vol. 150(C), pages 27-33.
    • Handle: RePEc:eee:gamebe:v:150:y:2025:i:c:p:27-33
    DOI: 10.1016/j.geb.2024.11.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825624001787
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2024.11.016?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    3. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    4. Szilvia Pápai & Péter Biró & Flip Klijn, 2022. "Balanced Exchange in a Multi-Unit Shapley-Scarf Market," Working Papers 1342, Barcelona School of Economics.
    5. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2022. "Coalition-proof stable networks," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 185-209, June.
    6. Fuhito Kojima & Mihai Manea, 2010. "Axioms for Deferred Acceptance," Econometrica, Econometric Society, vol. 78(2), pages 633-653, March.
    7. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2017. "Immunity to credible deviations from the truth," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 129-140.
    8. Ritz, Zvi, 1983. "Restricted domains, arrow-social welfare functions and noncorruptible and non-manipulable social choice correspondences: The case of private alternatives," Mathematical Social Sciences, Elsevier, vol. 4(2), pages 155-179, April.
    9. Bade, Sophie, 2016. "Fairness and group-strategyproofness clash in assignment problems," Journal of Economic Theory, Elsevier, vol. 165(C), pages 257-262.
    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. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    2. Christian Basteck, 2025. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
    3. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    4. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    5. Thayer Morrill, 2013. "An alternative characterization of the deferred acceptance algorithm," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 19-28, February.
    6. Basteck, Christian, 2025. "An axiomatization of the random priority rule," Discussion Papers, Research Unit: Market Behavior SP II 2024-201r, WZB Berlin Social Science Center, revised 2025.
    7. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    8. Afacan, Mustafa Og̃uz & Dur, Umut Mert, 2017. "When preference misreporting is Harm[less]ful?," Journal of Mathematical Economics, Elsevier, vol. 72(C), pages 16-24.
    9. Ehlers, Lars & Klaus, Bettina, 2016. "Object allocation via deferred-acceptance: Strategy-proofness and comparative statics," Games and Economic Behavior, Elsevier, vol. 97(C), pages 128-146.
    10. Bade, Sophie, 2011. "Matching Allocation Problems with Endogenous Information Acquisition," VfS Annual Conference 2011 (Frankfurt, Main): The Order of the World Economy - Lessons from the Crisis 48735, Verein für Socialpolitik / German Economic Association.
    11. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    12. Doğan, Battal & Klaus, Bettina, 2018. "Object allocation via immediate-acceptance: Characterizations and an affirmative action application," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 140-156.
    13. Sophie Bade, 2012. "Serial Dictatorship: the Unique Optimal Allocation Rule when Information is Endogenous," Discussion Paper Series of the Max Planck Institute for Research on Collective Goods 2012_11, Max Planck Institute for Research on Collective Goods.
    14. Chen, Yan & Sönmez, Tayfun, 2011. "Corrigendum to "School choice: An experimental study" [J. Econ. Theory 127 (1) (2006) 202-231]," Journal of Economic Theory, Elsevier, vol. 146(1), pages 397-399, January.
    15. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    16. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    17. Morimitsu Kurino, 2014. "House Allocation with Overlapping Generations," American Economic Journal: Microeconomics, American Economic Association, vol. 6(1), pages 258-289, February.
    18. Marek Pycia & M. Utku Ünver, 2021. "Arrovian Efficiency and Auditability in Discrete Mechanism Design," Boston College Working Papers in Economics 1044, Boston College Department of Economics.
    19. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
    20. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:eee:gamebe:v:150:y:2025:i:c:p:27-33. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.