IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v54y2025i1d10.1007_s00182-025-00923-9.html
   My bibliography  Save this article

Waitlist engineering in discrete object allocations with outside option

Author

Listed:
  • Mustafa Oğuz Afacan

    (Qatar University)

  • Eray Cumbul

    (Università Cattolica del Sacro Cuore
    TOBB University of Economics and Technology)

Abstract

This study pursues how waitlists should be designed to achieve desirable outcomes in object allocation models with outside option. We adapt the usual stability notion to our setting and call it “sure stability." Our first mechanism—Deferred Acceptance with Straightforward Waitlists (DSW)—is surely stable, and it dominates other surely stable mechanisms unless waitlists are capped, otherwise, it is not even constrained efficient. Given this inefficiency of DSW, we propose Deferred Acceptance with Augmented Waitlists (DAW) mechanism. It is surely stable and improves DSW. Sure stability is incompatible with strategy-proofness, hence both mechanisms are manipulable. We also show that increasing the waitlist capacities is always at least weakly welfare-improving under each of them.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jogath:v:54:y:2025:i:1:d:10.1007_s00182-025-00923-9
    DOI: 10.1007/s00182-025-00923-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-025-00923-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-025-00923-9?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. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    2. 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.
    3. 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.
    4. Alexander Westkamp, 2013. "An analysis of the German university admissions system," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 561-589, August.
    5. Pereyra, Juan Sebastián, 2013. "A dynamic school choice model," Games and Economic Behavior, Elsevier, vol. 80(C), pages 100-114.
    6. Jacob D. Leshno, 2022. "Dynamic Matching in Overloaded Waiting Lists," American Economic Review, American Economic Association, vol. 112(12), pages 3876-3910, December.
    7. Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
    8. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," PSE-Ecole d'économie de Paris (Postprint) halshs-03968341, HAL.
    9. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," Post-Print halshs-03968341, HAL.
    10. Itai Feigenbaum & Yash Kanoria & Irene Lo & Jay Sethuraman, 2020. "Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations," Management Science, INFORMS, vol. 66(11), pages 5341-5361, November.
    11. Julien Combe & Olivier Tercieux & Camille Terrier, 2022. "The Design of Teacher Assignment: Theory and Evidence," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 89(6), pages 3154-3222.
    12. Nikhil Agarwal & Itai Ashlagi & Michael A. Rees & Paulo Somaini & Daniel Waldinger, 2021. "Equilibrium Allocations Under Alternative Waitlist Designs: Evidence From Deceased Donor Kidneys," Econometrica, Econometric Society, vol. 89(1), pages 37-76, January.
    13. Ekmekci, Mehmet & Yenmez, M. Bumin, 2019. "Common enrollment in school choice," Theoretical Economics, Econometric Society, vol. 14(4), November.
    14. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    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. Maxey, Tyler, 2023. "Dynamic matching with transfers," Economics Letters, Elsevier, vol. 233(C).
    3. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    4. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
    5. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    6. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
    7. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    8. Vincent Iehlé, 2016. "Gradual College Admisssion," Post-Print halshs-02367006, HAL.
    9. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    10. Haeringer, Guillaume & Iehlé, Vincent, 2021. "Gradual college admission," Journal of Economic Theory, Elsevier, vol. 198(C).
    11. Kamada, Yuichiro & Kojima, Fuhito, 2017. "Stability concepts in matching under distributional constraints," Journal of Economic Theory, Elsevier, vol. 168(C), pages 107-142.
    12. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    13. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2025. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," The Review of Economics and Statistics, MIT Press, vol. 107(1), pages 1-13, January.
    14. Yuen Leng Chow & Isa E. Hafalir & Abdullah Yavas, 2015. "Auction versus Negotiated Sale: Evidence from Real Estate Sales," Real Estate Economics, American Real Estate and Urban Economics Association, vol. 43(2), pages 432-470, June.
    15. Chen, Yan & Kesten, Onur, 2019. "Chinese college admissions and school choice reforms: An experimental study," Games and Economic Behavior, Elsevier, vol. 115(C), pages 83-100.
    16. Aygün, Orhan & Turhan, Bertan, 2020. "Dynamic reserves in matching markets," Journal of Economic Theory, Elsevier, vol. 188(C).
    17. Afacan, Mustafa Oǧuz, 2024. "Non-vetoed matching with status quo," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    18. Umut Dur & Onur Kesten, 2019. "Sequential versus simultaneous assignment systems and two applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(2), pages 251-283, September.
    19. Avataneo, Michelle & Turhan, Bertan, 2021. "Slot-specific priorities with capacity transfers," Games and Economic Behavior, Elsevier, vol. 129(C), pages 536-548.
    20. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.

    More about this item

    Keywords

    Waitlist; Matching; Mechanism; Allocation; Sure stability; Strategy-proofness;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    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:spr:jogath:v:54:y:2025:i:1:d:10.1007_s00182-025-00923-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.