IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v165y2016icp257-262.html
   My bibliography  Save this article

Fairness and group-strategyproofness clash in assignment problems

Author

Listed:
  • Bade, Sophie

Abstract

No group-strategyproof and ex-post Pareto optimal random matching mechanism treats equals equally. Every mechanism that arises out of the randomization over a set of non-bossy and strategyproof mechanisms is non-bossy. Random serial dictatorship, which arises out of a randomization over all deterministic serial dictatorships is non-bossy but not group-strategyproof.

Suggested Citation

  • Bade, Sophie, 2016. "Fairness and group-strategyproofness clash in assignment problems," Journal of Economic Theory, Elsevier, vol. 165(C), pages 257-262.
    • Handle: RePEc:eee:jetheo:v:165:y:2016:i:c:p:257-262
    DOI: 10.1016/j.jet.2016.04.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022053116300321
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jet.2016.04.012?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. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. Alexander Nesterov, "undated". "Fairness and Efficiency in a Random Assignment: Three Impossibility Results," BDPEMS Working Papers 2014006, Berlin School of Economics.
    3. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    4. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2016. "Group Strategy-Proofness in Private Good Economies," American Economic Review, American Economic Association, vol. 106(4), pages 1073-1099, April.
    5. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 557-567.
    6. Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 48(4), pages 587-597.
    7. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    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. Harless, Patrick & Phan, William, 2022. "Efficient mixtures of priority rules for assigning objects," Games and Economic Behavior, Elsevier, vol. 132(C), pages 73-89.
    2. Ramezanian, Rasoul & Feizi, Mehdi, 2022. "Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results," Games and Economic Behavior, Elsevier, vol. 135(C), pages 356-367.
    3. Zhang, Jun, 2020. "When are efficient and fair assignment mechanisms group strategy-proof?," Games and Economic Behavior, Elsevier, vol. 119(C), pages 251-266.
    4. Morimoto, Shuhei, 2022. "Group strategy-proof probabilistic voting with single-peaked preferences," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    5. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    6. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.

    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. Ehlers, Lars & Majumdar, Dipjyoti & Mishra, Debasis & Sen, Arunava, 2020. "Continuity and incentive compatibility in cardinal mechanisms," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 31-41.
    2. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    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. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    5. EHLERS, Lars & MAJUMDAR, Dipjyoti & MISHRA, Debasis & SEN, Arunava, 2016. "Continuity and incentive compatibility," Cahiers de recherche 2016-04, Universite de Montreal, Departement de sciences economiques.
    6. Raghavan, Madhav, 2020. "Influence in private-goods allocation," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 14-28.
    7. Bogomolnaia, Anna & Deb, Rajat & Ehlers, Lars, 2005. "Strategy-proof assignment on the full preference domain," Journal of Economic Theory, Elsevier, vol. 123(2), pages 161-186, August.
    8. Ekici, Özgün, 2013. "Reclaim-proof allocation of indivisible objects," Games and Economic Behavior, Elsevier, vol. 81(C), pages 1-10.
    9. Lars EHLERS & Dipjyoti MAJUMDAR & Debasis MISHRA & Arunava SEN, 2016. "Continuity and Incentive Compatibility in Cardinal Voting Mechanisms," Cahiers de recherche 04-2016, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    10. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    11. Ehlers, Lars & Klaus, Bettina, 2006. "Efficient priority rules," Games and Economic Behavior, Elsevier, vol. 55(2), pages 372-384, May.
    12. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    13. 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.
    14. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    15. Karakaya, Mehmet & Klaus, Bettina & Schlegel, Jan Christoph, 2019. "Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants," Journal of Economic Theory, Elsevier, vol. 184(C).
    16. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    17. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    18. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
    19. 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.
    20. Chatterji, Shurojit & Liu, Peng, 2020. "Random assignments of bundles," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 15-30.

    More about this item

    Keywords

    Random matching mechanism; Non-bossy; Group-strategyproof; Random serial dictatorship;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:jetheo:v:165:y:2016:i:c:p:257-262. 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/622869 .

    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.