IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v233y2023ics0165176523003919.html

Dynamic matching with transfers

Author

Listed:
  • Maxey, Tyler

Abstract

I study a two-sided market of dynamic matching with sequential arrivals. Agents trade off waiting to match with a more desirable agent with immediately matching with a less desirable agent. I study the consequences of transfer availability for two protocols: first-in-first-out (FIFO) and last-in-first-out (LIFO). For FIFO, welfare is weakly greater with transfers than without. For LIFO, there is a range of waiting costs such that welfare is weakly lower with transfers than without. For sufficiently low waiting costs, the equilibrium welfare for FIFO with transfers remains strictly lower than socially optimal. Thus, unlike in a static matching setting, transfers in my dynamic matching setting do not generate utilitarian efficient outcomes.

Suggested Citation

  • Maxey, Tyler, 2023. "Dynamic matching with transfers," Economics Letters, Elsevier, vol. 233(C).
    • Handle: RePEc:eee:ecolet:v:233:y:2023:i:c:s0165176523003919
    DOI: 10.1016/j.econlet.2023.111366
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176523003919
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2023.111366?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," Post-Print halshs-03968341, HAL.
    2. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2020. "Optimal dynamic matching," Theoretical Economics, Econometric Society, vol. 15(3), July.
    3. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    4. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," American Economic Journal: Microeconomics, American Economic Association, vol. 9(1), pages 88-122, February.
    5. Jacob D. Leshno, 2022. "Dynamic Matching in Overloaded Waiting Lists," American Economic Review, American Economic Association, vol. 112(12), pages 3876-3910, December.
    6. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," PSE-Ecole d'économie de Paris (Postprint) halshs-03968341, HAL.
    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. Lei, Xiaochang, 2023. "Optimal queue to minimize waste," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 87-94.
    2. Mustafa Oğuz Afacan & Eray Cumbul, 2025. "Waitlist engineering in discrete object allocations with outside option," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-22, June.
    3. Zhiyuan Chen & Rui & Chen & Ming Hu & Yun Zhou, 2026. "Dynamic Matching Under Patience Imbalance," Papers 2602.03995, arXiv.org.
    4. Yeon-Koo Che, 2025. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
    5. René Caldentey & Lisa Aoki Hillas & Varun Gupta, 2025. "Designing Service Menus for Bipartite Queueing Systems," Operations Research, INFORMS, vol. 73(3), pages 1496-1534, May.
    6. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
    7. Philipp Afèche & René Caldentey & Varun Gupta, 2022. "On the Optimal Design of a Bipartite Matching Queueing System," Operations Research, INFORMS, vol. 70(1), pages 363-401, January.
    8. Afshin Nikzad & Philipp Strack, 2024. "Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies," Management Science, INFORMS, vol. 70(8), pages 5187-5207, August.
    9. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    10. Filip Tokarski, 2025. "Screening with damages and ordeals," Papers 2508.04456, arXiv.org, revised Jan 2026.
    11. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    12. Refael Hassin & Adam Nathaniel, 2021. "Self-Selected Task Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 23(6), pages 1669-1682, November.
    13. Doval, Laura & Szentes, Balázs, 2025. "On the efficiency of queueing in dynamic matching markets," Games and Economic Behavior, Elsevier, vol. 150(C), pages 106-130.
    14. Buurma-Olsen, Jennifer & Koster, Hans R.A. & van Ommeren, Jos & Damsté, Jort Sinninghe, 2025. "Quantifying misallocation of public housing," Journal of Public Economics, Elsevier, vol. 242(C).
    15. Doval, Laura, 2022. "Dynamically stable matching," Theoretical Economics, Econometric Society, vol. 17(2), May.
    16. Ludwig Dierks & Nils Olberg & Sven Seuken & Vincent W. Slaugh & M. Utku Ünver, 2025. "Search and Matching for Adoption from Foster Care," Boston College Working Papers in Economics 1093, Boston College Department of Economics.
    17. Pietro Ortoleva & Evgenii Safonov & Leeat Yariv, 2021. "Who Cares More? Allocation with Diverse Preference Intensities," Working Papers 2021-10, Princeton University. Economics Department..
    18. Lingbo Huang & Tracy Xiao Liu & Jun Zhang, 2023. "Born to wait? A study on allocation rules in booking systems," Discussion Papers 2023-04, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
    19. Nick Arnosti & Peng Shi, 2020. "Design of Lotteries and Wait-Lists for Affordable Housing Allocation," Management Science, INFORMS, vol. 66(6), pages 2291-2307, June.
    20. Mertikopoulos, Panayotis & Nax, Heinrich H. & Pradelski, Bary S.R., 2024. "Quick or cheap? Breaking points in dynamic markets," Journal of Mathematical Economics, Elsevier, vol. 112(C).

    More about this item

    Keywords

    ;
    ;
    ;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:ecolet:v:233:y:2023:i:c:s0165176523003919. 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/ecolet .

    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.