IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v95y2020i1d10.1007_s11134-019-09642-x.html
   My bibliography  Save this article

Benchmark policies for utility-carrying queues with impatience

Author

Listed:
  • Yael Deutsch

    (Bar-Ilan University)

  • Israel David

    (Holon Institute of Technology)

Abstract

Men and jobs alike are characterized by a single trait, which may take on categorical values according to given population frequencies. Men arrive to the system following a Poisson process and wait till jobs are assigned to them. Jobs arrive to the system following another, independent, Poisson process. An arriving job must be assigned to a waiting man immediately, or be discarded, ensuing no gain. An assignment of a job to a man yields a higher gain if they match in trait, and a lower one if not. Each man waits a limited time for a job and leaves the system if unassigned by that time limit. It is stipulated that a man who arrives first has priority to either accept the pending job, or to pass it to the next man, who makes a similar decision. The last man in the line takes the job, or it is discarded. The individually optimal policy for each man is defined by some critical time for accepting a mismatched job. We solve for the critical times, depending on the mens’ place in the queue, and obtain expressions for the ensuing optimal value functions of this system, for expected gain. The model originates from the utility-equity dilemma in assigning live organs to patients on the national waiting list. The paper reports numerical comparison of the above policy with alternative ones, for several performance measures.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:queues:v:95:y:2020:i:1:d:10.1007_s11134-019-09642-x
    DOI: 10.1007/s11134-019-09642-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-019-09642-x
    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/s11134-019-09642-x?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. Israel David & Uri Yechiali, 1995. "One-Attribute Sequential Assignment Match Processes in Discrete Time," Operations Research, INFORMS, vol. 43(5), pages 879-884, October.
    2. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    3. Stefanos A. Zenios & Glenn M. Chertow & Lawrence M. Wein, 2000. "Dynamic Allocation of Kidneys to Candidates on the Transplant Waiting List," Operations Research, INFORMS, vol. 48(4), pages 549-569, August.
    4. Dimitris Bertsimas & Romy Shioda, 2003. "Restaurant Revenue Management," Operations Research, INFORMS, vol. 51(3), pages 472-486, 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. 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.
    7. Edward H. Kaplan, 1986. "Tenant Assignment Models," Operations Research, INFORMS, vol. 34(6), pages 832-843, December.
    8. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2013. "Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation," Operations Research, INFORMS, vol. 61(1), pages 73-87, February.
    9. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2004. "The Optimal Timing of Living-Donor Liver Transplantation," Management Science, INFORMS, vol. 50(10), pages 1420-1430, October.
    10. Israel David & Uri Yechiali, 1985. "A Time-dependent Stopping Problem with Application to Live Organ Transplants," Operations Research, INFORMS, vol. 33(3), pages 491-504, June.
    11. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    12. Bendersky, Michael & David, Israel, 2016. "Deciding kidney-offer admissibility dependent on patients’ lifetime failure rate," European Journal of Operational Research, Elsevier, vol. 251(2), pages 686-693.
    13. Dimitris Bertsimas & Sarah Stock Patterson, 1998. "The Air Traffic Flow Management Problem with Enroute Capacities," Operations Research, INFORMS, vol. 46(3), pages 406-422, June.
    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. Matsue, Toyoki, 2022. "Role of worker flows in the relationship between job offers and employment," MPRA Paper 115316, University Library of Munich, Germany.

    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. 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.
    2. 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.
    3. Sahar Ahmadvand & Mir Saman Pishvaee, 2018. "An efficient method for kidney allocation problem: a credibility-based fuzzy common weights data envelopment analysis approach," Health Care Management Science, Springer, vol. 21(4), pages 587-603, December.
    4. 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.
    5. Kargar, Bahareh & Pishvaee, Mir Saman & Jahani, Hamed & Sheu, Jiuh-Biing, 2020. "Organ transportation and allocation problem under medical uncertainty: A real case study of liver transplantation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    6. 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.
    7. Sakine Batun & Andrew J. Schaefer & Atul Bhandari & Mark S. Roberts, 2018. "Optimal Liver Acceptance for Risk-Sensitive Patients," Service Science, INFORMS, vol. 10(3), pages 320-333, September.
    8. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List," Operations Research, INFORMS, vol. 55(1), pages 24-36, February.
    9. Perlman, Yael & Elalouf, Amir & Yechiali, Uri, 2018. "Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation," European Journal of Operational Research, Elsevier, vol. 265(1), pages 169-177.
    10. Murat Kurt & Mark S. Roberts & Andrew J. Schaefer & M. Utku Ünver, 2011. "Valuing Prearranged Paired Kidney Exchanges: A Stochastic Game Approach," Boston College Working Papers in Economics 785, Boston College Department of Economics, revised 14 Oct 2011.
    11. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Choosing Among Living-Donor and Cadaveric Livers," Management Science, INFORMS, vol. 53(11), pages 1702-1715, November.
    12. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2013. "Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation," Operations Research, INFORMS, vol. 61(1), pages 73-87, February.
    13. 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.
    14. 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.
    15. Sheldon Ross & David Wu, 2013. "A generalized coupon collecting model as a parsimonious optimal stochastic assignment model," Annals of Operations Research, Springer, vol. 208(1), pages 133-146, September.
    16. Sepehr Nemati & Zeynep G. Icten & Lisa M. Maillart & Andrew J. Schaefer, 2020. "Mitigating Information Asymmetry in Liver Allocation," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 234-248, April.
    17. Burhaneddin Sandıkçı & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2013. "Alleviating the Patient's Price of Privacy Through a Partially Observable Waiting List," Management Science, INFORMS, vol. 59(8), pages 1836-1854, August.
    18. 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.
    19. Xuanming Su & Stefanos A. Zenios, 2006. "Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model," Management Science, INFORMS, vol. 52(11), pages 1647-1660, November.
    20. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.

    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:queues:v:95:y:2020:i:1:d:10.1007_s11134-019-09642-x. 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.