IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v296y2022i3p776-787.html
   My bibliography  Save this article

Minimal envy and popular matchings

Author

Listed:
  • Kondratev, Aleksei Y.
  • Nesterov, Alexander S.

Abstract

We study ex-post fairness and efficiency in the object allocation problem. A matching is individually fair if it minimizes the number of envying agents, we call it minimal envy matching, and conditional on being minimal envy also minimizes the number of envying agents in a reduced problem, we call it minimal envy-2 matching. A matching is socially fair if supported by the majority of agents against any other matching – popular matching. We observe that when a popular matching exists it is equivalent to a minimal envy-2 matching.

Suggested Citation

  • Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    • Handle: RePEc:eee:ejores:v:296:y:2022:i:3:p:776-787
    DOI: 10.1016/j.ejor.2021.03.060
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721002903
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.03.060?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. Young, H. P., 1977. "Extending Condorcet's rule," Journal of Economic Theory, Elsevier, vol. 16(2), pages 335-353, December.
    2. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaya, 2017. "Competitive Division of a Mixed Manna," Econometrica, Econometric Society, vol. 85(6), pages 1847-1871, November.
    3. Eric McDermid & Robert W. Irving, 2011. "Popular matchings: structure and algorithms," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 339-358, October.
    4. Ágnes Cseh & Martin Skutella, 2019. "Paths to stable allocations," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(3), pages 835-862, September.
    5. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    6. Agnes Cseh & Chien-Chung Huang & Telikepalli Kavitha, 2017. "Popular matchings with two-sided preferences and one-sided ties," CERS-IE WORKING PAPERS 1723, Institute of Economics, Centre for Economic and Regional Studies.
    7. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
    8. Robert Aue & Thilo Klein & Josue Ortega, 2020. "What Happens when Separate and Unequal School Districts Merge?," Papers 2006.13209, arXiv.org.
    9. Mustafa Oğuz Afacan & Inácio Bó & Bertan Turhan, 2023. "Assignment maximization," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 25(1), pages 123-138, February.
    10. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
    11. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    12. Aytek Erdil & Haluk Ergin, 2008. "What's the Matter with Tie-Breaking? Improving Efficiency in School Choice," American Economic Review, American Economic Association, vol. 98(3), pages 669-689, June.
    13. William Thomson, 2011. "Consistency and its converse: an introduction," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 257-291, December.
    14. Somouaoga Bonkoungou & Alexander Nesterov, 2020. "Comparing School Choice And College Admission Mechanisms By Their Immunity To Strategic Admissions," HSE Working papers WP BRP 222/EC/2020, National Research University Higher School of Economics.
    15. 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.
    16. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    17. Onur Kesten & Ayşe Yazıcı, 2012. "The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 463-488, June.
    18. Hervé Moulin, 2019. "Fair Division in the Internet Age," Annual Review of Economics, Annual Reviews, vol. 11(1), pages 407-441, August.
    19. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    20. Umut Dur & Parag A. Pathak & Fei Song & Tayfun Sönmez, 2022. "Deduction Dilemmas: The Taiwan Assignment Mechanism," American Economic Journal: Microeconomics, American Economic Association, vol. 14(1), pages 164-185, February.
    21. Yuan, Yufei, 1996. "Residence exchange wanted: A stable residence exchange problem," European Journal of Operational Research, Elsevier, vol. 90(3), pages 536-546, May.
    22. Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-1480, November.
    23. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    24. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
    25. Roth, Alvin E & Sotomayor, Marilda, 1989. "The College Admissions Problem Revisited," Econometrica, Econometric Society, vol. 57(3), pages 559-570, May.
    26. Andreas Darmann, 2016. "It is difficult to tell if there is a Condorcet spanning tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 93-104, August.
    27. Yan Chen & Onur Kesten, 2017. "Chinese College Admissions and School Choice Reforms: A Theoretical Analysis," Journal of Political Economy, University of Chicago Press, vol. 125(1), pages 99-139.
    28. Fuhito Kojima & M. Ünver, 2008. "Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 473-488, March.
    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. Afacan, Mustafa Oğuz & Bó, Inácio, 2022. "Strategy-proof popular mechanisms," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    2. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.

    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. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    2. Somouaoga Bonkoungou & Alexander Nesterov, 2020. "Reforms meet fairness concerns in school and college admissions," Papers 2009.05245, arXiv.org, revised Jan 2022.
    3. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    4. Benoit Decerf, 2023. "A modification aimed at reducing the manipulability and inefficiency of the Boston school choice mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 75-101, January.
    5. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    6. Erdil, Aytek & Ergin, Haluk, 2017. "Two-sided matching with indifferences," Journal of Economic Theory, Elsevier, vol. 171(C), pages 268-292.
    7. Ayoade, Nickesha & Pápai, Szilvia, 2023. "School choice with preference rank classes," Games and Economic Behavior, Elsevier, vol. 137(C), pages 317-341.
    8. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    9. Atı̇la Abdulkadı̇roğlu & Joshua D. Angrist & Yusuke Narita & Parag Pathak, 2022. "Breaking Ties: Regression Discontinuity Design Meets Market Design," Econometrica, Econometric Society, vol. 90(1), pages 117-151, January.
    10. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    11. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    12. John William Hatfield & Fuhito Kojima & Yusuke Narita, 2011. "Promoting School Competition Through School Choice: A Market Design Approach," Working Papers 2011-018, Human Capital and Economic Opportunity Working Group.
    13. Han, Xiang, 2018. "Stable and efficient resource allocation under weak priorities," Games and Economic Behavior, Elsevier, vol. 107(C), pages 1-20.
    14. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    15. 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.
    16. Ning Sun & Zaifu Yang, 2016. "A Theory of Marriage with Mutually Consented Divorces," Discussion Papers 16/14, Department of Economics, University of York.
    17. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    18. Rustamdjan Hakimov & Onur Kesten, 2018. "The Equitable Top Trading Cycles Mechanism For School Choice," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 59(4), pages 2219-2258, November.
    19. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
    20. Somouaoga Bonkoungou & Alexander S. Nesterov, 2020. "Comparing School Choice and College Admission Mechanisms By Their Immunity to Strategic Admissions," Papers 2001.06166, arXiv.org, revised Jan 2020.

    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:ejores:v:296:y:2022:i:3:p:776-787. 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/eor .

    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.