IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v71y2025i5p4396-4412.html
   My bibliography  Save this article

A Dynamic Matching Mechanism for College Admissions: Theory and Experiment

Author

Listed:
  • Binglin Gong

    (School of Economics and Management, KLATASDS-MOE, East China Normal University, Shanghai 200062, China; and Research Center for Common Prosperity, Future Regional Development Laboratory, Innovation Center of Yangtze River Delta, Zhejiang University, Jiaxing 314100, China)

  • Yingzhi Liang

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Market design provides managerial insights into the success and failure of various market institutions in allocating scarce resources. We investigate a dynamic matching mechanism used in real-world college admissions, where students share a common priority ranking. Theoretically, we prove that efficient and stable matching occurs with an arbitrarily high probability, assuming sufficient revision opportunities and rationality. This predicts that the dynamic mechanism is less stable than the deferred acceptance mechanism and less efficient than the Boston mechanism. We confirm this prediction in a low-complexity laboratory setting. However, in a high-complexity setting, the dynamic mechanism matches the stability of the deferred acceptance and the efficiency of the Boston mechanism, as both underperform in this setting. This finding indicates that the dynamic mechanism is more resilient to increased complexity. We attribute this resilience to its belief-independent characterization of rationalizable strategies. Beyond college admissions, the dynamic mechanism has potential applications in housing assignments, job allocations, and ascending auctions.

Suggested Citation

  • Binglin Gong & Yingzhi Liang, 2025. "A Dynamic Matching Mechanism for College Admissions: Theory and Experiment," Management Science, INFORMS, vol. 71(5), pages 4396-4412, May.
    • Handle: RePEc:inm:ormnsc:v:71:y:2025:i:5:p:4396-4412
    DOI: 10.1287/mnsc.2022.00871
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.00871
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2022.00871?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:inm:ormnsc:v:71:y:2025:i:5:p:4396-4412. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.