Benchmark policies for utility-carrying queues with impatience
From MaRDI portal
Publication:2210664
DOI10.1007/s11134-019-09642-xzbMath1461.60076OpenAlexW2996789222WikidataQ126411999 ScholiaQ126411999MaRDI QIDQ2210664
Publication date: 8 November 2020
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-019-09642-x
double-ended queuessequential stochastic assignmentfairness in queuesproblem of best choiceutility-equity dilemma
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequity averse optimization in operational research
- Deciding kidney-offer admissibility dependent on patients' lifetime failure rate
- Modeling the transplant waiting list: A queueing model with reneging
- The Air Traffic Flow Management Problem with Enroute Capacities
- A Sequential Assignment Match Process with General Renewal Arrival Times
- Multiple-stopping problems with random horizon
- The full-information best-choice problem with uniform or gamma horizons
- A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES
- The Optimal Timing of Living-Donor Liver Transplantation
- Sequential Assignment Match Processes with Arrivals of Candidates and Offers
- QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
- A Time-dependent Stopping Problem with Application to Live Organ Transplants
- On multiple stopping bales
- On measuring fairness in queues
- One-Attribute Sequential Assignment Match Processes in Discrete Time
- Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- A Sequential Stochastic Assignment Problem
This page was built for publication: Benchmark policies for utility-carrying queues with impatience
