IDEAS home Printed from https://ideas.repec.org/a/aea/aerins/v4y2022i2p223-38.html
   My bibliography  Save this article

Top of the Batch: Interviews and the Match

Author

Listed:
  • Federico Echenique
  • Ruy González
  • Alistair J. Wilson
  • Leeat Yariv

Abstract

Most doctors in the National Resident Matching Program (NRMP) match with one of their most preferred internship programs. However, surveys indicate doctors' preferences are similar, suggesting a puzzle: how can so many doctors match with their top choices when positions are scarce? We provide one possible explanation. We show that the patterns in the NRMP data may be an artifact of the interview process that precedes the match. Our study highlights the importance of understanding market interactions occurring before and after a matching clearinghouse. It casts doubts on analyses of clearinghouses that take reported preferences at face value.

Suggested Citation

  • Federico Echenique & Ruy González & Alistair J. Wilson & Leeat Yariv, 2022. "Top of the Batch: Interviews and the Match," American Economic Review: Insights, American Economic Association, vol. 4(2), pages 223-238, June.
    • Handle: RePEc:aea:aerins:v:4:y:2022:i:2:p:223-38
    DOI: 10.1257/aeri.20200800
    as

    Download full text from publisher

    File URL: https://www.aeaweb.org/doi/10.1257/aeri.20200800
    Download Restriction: no
    File URL: https://doi.org/10.3886/E141541V1
    Download Restriction: no
    File URL: https://www.aeaweb.org/doi/10.1257/aeri.20200800.appx
    Download Restriction: no
    File URL: https://www.aeaweb.org/doi/10.1257/aeri.20200800.ds
    Download Restriction: Access to full text is restricted to AEA members and institutional subscribers.
    File URL: https://libkey.io/10.1257/aeri.20200800?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
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Tamás Fleiner, 2003. "A Fixed-Point Approach to Stable Matchings and Some Applications," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 103-126, February.
    2. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    3. repec:oup:restud:v:84:y::i:1:p:444-463. is not listed on IDEAS
    4. Nikhil Agarwal, 2015. "An Empirical Model of the Medical Match," American Economic Review, American Economic Association, vol. 105(7), pages 1939-1978, July.
    5. Avinatan Hassidim & Déborah Marciano & Assaf Romm & Ran I. Shorrer, 2017. "The Mechanism Is Truthful, Why Aren't You?," American Economic Review, American Economic Association, vol. 107(5), pages 220-224, May.
    6. Charles Blair, 1988. "The Lattice Structure of the Set of Stable Matchings with Multiple Partners," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 619-628, November.
    7. Li Chen & Juan Sebastian Pereyra Barreiro, 2015. "Self-Selection in School Choice," Working Papers ECARES ECARES 2015-52, ULB -- Universite Libre de Bruxelles.
    8. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    9. Rees-Jones, Alex, 2018. "Suboptimal behavior in strategy-proof mechanisms: Evidence from the residency match," Games and Economic Behavior, Elsevier, vol. 108(C), pages 317-330.
    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. Yash Kanoria & Seungki Min & Pengyu Qian, 2020. "The Competition for Partners in Matching Markets," Papers 2006.14653, arXiv.org, revised Jan 2023.
    2. Maxwell Allman & Itai Ashlagi, 2023. "Interviewing Matching in Random Markets," Papers 2305.11350, arXiv.org, revised Sep 2023.
    3. Maxey, Tyler, 2024. "School choice with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 143(C), pages 248-268.

    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. 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.
    2. Hakimov, Rustamdjan & Kübler, Dorothea, 2021. "Experiments on centralized school choice and college admissions: a survey," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 24(2), pages 434-488.
    3. David Cantala, 2011. "Agreement toward stability in matching markets," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 293-316, December.
    4. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
    5. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    6. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    7. Grenet, Julien & He, YingHua & Kübler, Dorothea, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 130(6), pages 1-1.
    8. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    9. Hakimov, Rustamdjan & Kübler, Dorothea, 2019. "Experiments On Matching Markets: A Survey," Rationality and Competition Discussion Paper Series 153, CRC TRR 190 Rationality and Competition.
    10. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
    11. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    12. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    13. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    14. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    15. Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "Lattice structure of the random stable set in many-to-many matching markets," Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
    16. Meisner, Vincent & von Wangenheim, Jonas, 2019. "School Choice and Loss Aversion," Rationality and Competition Discussion Paper Series 208, CRC TRR 190 Rationality and Competition.
    17. Tam'as Fleiner & Zsuzsanna Jank'o & Ildik'o Schlotter & Alexander Teytelboym, 2018. "Complexity of Stability in Trading Networks," Papers 1805.08758, arXiv.org, revised Feb 2019.
    18. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    19. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    20. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • I11 - Health, Education, and Welfare - - Health - - - Analysis of Health Care Markets
    • I18 - Health, Education, and Welfare - - Health - - - Government Policy; Regulation; Public Health
    • J44 - Labor and Demographic Economics - - Particular Labor Markets - - - Professional Labor Markets and Occupations

    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:aea:aerins:v:4:y:2022:i:2:p:223-38. 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: Michael P. Albert (email available below). General contact details of provider: https://edirc.repec.org/data/aeaaaea.html .

    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.