IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v123y2023icp87-94.html
   My bibliography  Save this article

Optimal queue to minimize waste

Author

Listed:
  • Lei, Xiaochang

Abstract

We study an application of stochastic games in the dynamic allocation of two types of goods when agents have deferral rights. If all individuals strictly prefer one good to the other, the worse good can be wasted by successive rejections. We allow different goods to be allocated in different ways and study the combinations of three popular disciplines in an overloaded waiting list: FCFS (first-come-first-serve), LCFS(last-come-first-serve) and RP(random-priority). The first result is that the LCFS–FCFS queue (the better good allocated under LCFS and the worse good allocated under FCFS) does result in zero waste, but it is unfair. To restore fairness, the agent’s age matters and the older agent has a weakly higher probability of receiving goods. Our second result is that RP–FCFS is fair and induces less expected waste than FCFS when the waiting cost is uniformly distributed.

Suggested Citation

  • Lei, Xiaochang, 2023. "Optimal queue to minimize waste," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 87-94.
    • Handle: RePEc:eee:matsoc:v:123:y:2023:i:c:p:87-94
    DOI: 10.1016/j.mathsocsci.2023.03.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489623000239
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2023.03.001?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. 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. 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.
    5. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    6. 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.
    7. Xuanming Su & Stefanos A. Zenios, 2005. "Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model," Operations Research, INFORMS, vol. 53(3), pages 443-455, June.
    8. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    9. Jacob D. Leshno, 2022. "Dynamic Matching in Overloaded Waiting Lists," American Economic Review, American Economic Association, vol. 112(12), pages 3876-3910, December.
    10. Neil Thakral, 2019. "Matching with Stochastic Arrival," AEA Papers and Proceedings, American Economic Association, vol. 109, pages 209-212, May.
    11. 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. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    2. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
    3. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    4. 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.
    5. Doval, Laura, 2022. "Dynamically stable matching," Theoretical Economics, Econometric Society, vol. 17(2), May.
    6. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
    7. 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.
    8. Turgay Ayer & Can Zhang & Anthony Bonifonte & Anne C. Spaulding & Jagpreet Chhatwal, 2019. "Prioritizing Hepatitis C Treatment in U.S. Prisons," Operations Research, INFORMS, vol. 67(3), pages 853-873, May.
    9. Pietro Ortoleva & Evgenii Safonov & Leeat Yariv, 2021. "Who Cares More? Allocation with Diverse Preference Intensities," Papers 2108.12025, arXiv.org.
    10. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    11. Mustafa Akan & Oguzhan Alagoz & Baris Ata & Fatih Safa Erenay & Adnan Said, 2012. "A Broader View of Designing the Liver Allocation System," Operations Research, INFORMS, vol. 60(4), pages 757-770, August.
    12. Zahra Gharibi & Michael Hahsler, 2021. "A Simulation-Based Optimization Model to Study the Impact of Multiple-Region Listing and Information Sharing on Kidney Transplant Outcomes," IJERPH, MDPI, vol. 18(3), pages 1-20, January.
    13. Can Zhang & Atalay Atasu & Turgay Ayer & L. Beril Toktay, 2020. "Truthful Mechanisms for Medical Surplus Product Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 735-753, July.
    14. Yael Deutsch & Israel David, 2020. "Benchmark policies for utility-carrying queues with impatience," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 97-120, June.
    15. 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.
    16. 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.
    17. Burhaneddin Sandıkçı & Lisa M. Maillart & Andrew J. Schaefer & Oguzhan Alagoz & Mark S. Roberts, 2008. "Estimating the Patient's Price of Privacy in Liver Transplantation," Operations Research, INFORMS, vol. 56(6), pages 1393-1410, December.
    18. Barış Ata & Anton Skaro & Sridhar Tayur, 2017. "OrganJet: Overcoming Geographical Disparities in Access to Deceased Donor Kidneys in the United States," Management Science, INFORMS, vol. 63(9), pages 2776-2794, September.
    19. Sait Tunç & Burhaneddin Sandıkçı & Bekir Tanrıöver, 2022. "A Simple Incentive Mechanism to Alleviate the Burden of Organ Wastage in Transplantation," Management Science, INFORMS, vol. 68(8), pages 5980-6002, August.
    20. Nikhil Agarwal & Itai Ashlagi & Michael A. Rees & Paulo J. Somaini & Daniel C. Waldinger, 2019. "Equilibrium Allocations under Alternative Waitlist Designs: Evidence from Deceased Donor Kidneys," NBER Working Papers 25607, National Bureau of Economic Research, Inc.

    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:matsoc:v:123:y:2023:i:c:p:87-94. 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/inca/505565 .

    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.