IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2312.09841.html

Monoculture in Matching Markets

Author

Listed:
  • Kenny Peng
  • Nikhil Garg

Abstract

Algorithmic monoculture arises when many decision-makers rely on the same algorithm to evaluate applicants. An emerging body of work investigates possible harms of this kind of homogeneity, but has been limited by the challenge of incorporating market effects in which the preferences and behavior of many applicants and decision-makers jointly interact to determine outcomes. Addressing this challenge, we introduce a tractable theoretical model of algorithmic monoculture in a two-sided matching market with many participants. We use the model to analyze outcomes under monoculture (when decision-makers all evaluate applicants using a common algorithm) and under polyculture (when decision-makers evaluate applicants independently). All else equal, monoculture (1) selects less-preferred applicants when noise is well-behaved, (2) matches more applicants to their top choice, though individual applicants may be worse off depending on their value to decision-makers and risk tolerance, and (3) is more robust to disparities in the number of applications submitted.

Suggested Citation

  • Kenny Peng & Nikhil Garg, 2023. "Monoculture in Matching Markets," Papers 2312.09841, arXiv.org.
    • Handle: RePEc:arx:papers:2312.09841
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Itai Ashlagi & Yash Kanoria & Jacob D. Leshno, 2017. "Unbalanced Random Matching Markets: The Stark Effect of Competition," Journal of Political Economy, University of Chicago Press, vol. 125(1), pages 69-98.
    2. Thaler, Richard H, 1988. "Anomalies: The Winner's Curse," Journal of Economic Perspectives, American Economic Association, vol. 2(1), pages 191-202, Winter.
    3. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    4. Ashlagi, Itai & Nikzad, Afshin & Romm, Assaf, 2019. "Assigning more students to their top choices: A comparison of tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 115(C), pages 167-187.
    5. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
    6. Nick Arnosti, 2023. "Lottery Design for School Choice," Management Science, INFORMS, vol. 69(1), pages 244-259, January.
    7. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    8. Gunter J. Hitsch & Ali Hortaçsu & Dan Ariely, 2010. "Matching and Sorting in Online Dating," American Economic Review, American Economic Association, vol. 100(1), pages 130-163, March.
    9. Monique De Haan & Pieter A. Gautier & Hessel Oosterbeek & Bas van der Klaauw, 2023. "The Performance of School Assignment Mechanisms in Practice," Journal of Political Economy, University of Chicago Press, vol. 131(2), pages 388-455.
    10. Caterina Calsamiglia & Guillaume Haeringer & Flip Klijn, 2010. "Constrained School Choice: An Experimental Study," American Economic Review, American Economic Association, vol. 100(4), pages 1860-1874, September.
    11. Eduardo M. Azevedo & Jacob D. Leshno, 2016. "A Supply and Demand Framework for Two-Sided Matching Markets," Journal of Political Economy, University of Chicago Press, vol. 124(5), pages 1235-1268.
    12. Allman, Maxwell & Ashlagi, Itai & Nikzad, Afshin, 2023. "On rank dominance of tie-breaking rules," Theoretical Economics, Econometric Society, vol. 18(2), May.
    13. Nick Arnosti, 2022. "A Continuum Model of Stable Matching With Finite Capacities," Papers 2205.12881, arXiv.org.
    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. Li, Mengling, 2020. "Ties matter: Improving efficiency in course allocation by allowing ties," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 354-384.
    2. Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
    3. Ashlagi, Itai & Nikzad, Afshin & Romm, Assaf, 2019. "Assigning more students to their top choices: A comparison of tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 115(C), pages 167-187.
    4. Hatfield, John William & Kojima, Fuhito & Narita, Yusuke, 2016. "Improving schools through school choice: A market design approach," Journal of Economic Theory, Elsevier, vol. 166(C), pages 186-211.
    5. Tong Wang & Congyi Zhou, 2020. "High school admission reform in China: a welfare analysis," Review of Economic Design, Springer;Society for Economic Design, vol. 24(3), pages 215-269, December.
    6. Nikhil Agarwal & Paulo Somaini, 2018. "Demand Analysis Using Strategic Reports: An Application to a School Choice Mechanism," Econometrica, Econometric Society, vol. 86(2), pages 391-444, March.
    7. Yuri Faenza & Aapeli Vuorinen, 2025. "Longer Lists Yield Better Matchings," Papers 2506.06217, arXiv.org.
    8. Nick Arnosti, 2022. "A Continuum Model of Stable Matching With Finite Capacities," Papers 2205.12881, arXiv.org.
    9. Lingbo Huang & Jun Zhang, 2025. "Making school choice lotteries transparent," Papers 2501.04243, arXiv.org, revised Dec 2025.
    10. Ashlagi, Itai & Nikzad, Afshin, 2020. "What matters in school choice tie-breaking? How competition guides design," Journal of Economic Theory, Elsevier, vol. 190(C).
    11. Hoyer, B. & Stroh-Maraun, N., 2020. "Matching strategies of heterogeneous agents under incomplete information in a university clearinghouse," Games and Economic Behavior, Elsevier, vol. 121(C), pages 453-481.
    12. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    13. Umut M. Dur & Scott Duke Kominers & Parag A. Pathak & Tayfun Sönmez, 2013. "The Demise of Walk Zones in Boston: Priorities vs. Precedence in School Choice," NBER Working Papers 18981, National Bureau of Economic Research, Inc.
    14. Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
    15. Dur, Umut Mert & Morrill, Thayer, 2020. "What you don't know can help you in school assignment," Games and Economic Behavior, Elsevier, vol. 120(C), pages 246-256.
    16. Yasushi Kawase & Keisuke Bando, 2021. "Subgame perfect equilibria under the deferred acceptance algorithm," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 503-546, June.
    17. Wu, Binzhen & Zhong, Xiaohan, 2020. "Matching inequality and strategic behavior under the Boston mechanism: Evidence from China's college admissions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 1-21.
    18. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
    19. Ding, Tingting & Schotter, Andrew, 2017. "Matching and chatting: An experimental study of the impact of network communication on school-matching mechanisms," Games and Economic Behavior, Elsevier, vol. 103(C), pages 94-115.
    20. Che, Yeon-Koo & Tercieux, Olivier, 2018. "Payoff equivalence of efficient mechanisms in large matching markets," Theoretical Economics, Econometric Society, vol. 13(1), January.

    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:arx:papers:2312.09841. 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.