One-Attribute Sequential Assignment Match Processes in Discrete Time

DOI10.1287/opre.43.5.879zbMath0842.90119MaRDI QIDQ4868808

Uri Yechiali, Israel David

Publication date: 7 March 1996

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/175654870f53db028f21fc00a0f1972b479e7867

zbMATH Keywords

sequential matching; live organ transplants; donor-recipient assignment

Mathematics Subject Classification ID

90C39: Dynamic programming

Related Items

Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities, Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective, Applications of fluid models in service operations management, A generalized coupon collecting model as a parsimonious optimal stochastic assignment model, Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation, Triply stochastic sequential assignment problem with the uncertainty in worker survival, Benchmark policies for utility-carrying queues with impatience, A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion, STOCHASTIC SEQUENTIAL ASSIGNMENT PROBLEM WITH ARRIVALS