Efficiency in lung transplant allocation strategies
From MaRDI portal
Publication:2044231
Abstract: Currently in the United States, lung transplantations are allocated to candidates according to the candidates' Lung Allocation Score (LAS). The LAS is an ad-hoc ranking system for patients' priorities of transplantation. The goal of this study is to develop a framework for improving patients' life expectancy over the LAS based on a comprehensive modeling of the lung transplantation waiting list. Patients and organs are modeled as arriving according to Poisson processes, patients' health status evolving a waiting time inhomogeneous Markov process until death or transplantation, with organ recipient's expected post-transplant residual life depending on waiting time and health status at transplantation. Under allocation rules satisfying minimal fairness requirements, the long-term average expected life converges, and its limit is a natural standard for comparing allocation strategies. Via the Hamilton-Jacobi-Bellman equations, upper bounds for the limiting average expected life are derived as a function of organ availability. Corresponding to each upper bound is an allocable set of (time, state) pairs at which patients would be optimally transplanted. The allocable set expands monotonically as organ availability increases, which motivates the development of an allocation strategy that leads to long-term expected life close to the upper bound. Simulation studies are conducted with model parameters estimated from national lung transplantation data. Results suggest that compared to the LAS, the proposed allocation strategy could provide a 7.7% increase in average total life. We further extended the results to the the allocation and matching of multiple organ types.
Recommendations
- Optimizing organ allocation and acceptance
- An exact method for balancing efficiency and equity in the liver allocation hierarchy
- Optimal arrangement of the pulmonary interventional surgeries considering timely distribution of medical consumables
- Asymptotically optimal allocation policies for transplant queueing systems
- Fairness, efficiency, and flexibility in organ allocation for kidney transplantation
- Prioritized organ allocation rules under compatibility constraints
- Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
Cites work
- A Broader View of Designing the Liver Allocation System
- A Resource Allocation Problem in a Random Environment
- A Sequential Stochastic Assignment Problem
- A Stochastic Sequential Allocation Model
- A survey of product-integration with a view toward application in survival analysis
- Assessing the causal effect of organ transplantation on the distribution of residual lifetime
- Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List
- Fairness, efficiency, and flexibility in organ allocation for kidney transplantation
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- scientific article; zbMATH DE number 3687126 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- scientific article; zbMATH DE number 3443893 (Why is no real title available?)
- Involving Patients in the Cadaveric Kidney Transplant Allocation Process: A Decision-Theoretic Perspective
- Kidney Exchange
- Modeling the transplant waiting list: A queueing model with reneging
- On the Gittins index for multiarmed bandits
- Pairwise kidney exchange
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Recipient choice can address the efficiency-equity trade-off in kidney transplantation: a mechanism design model
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Restless bandits, partial conservation laws and indexability
- The kidney exchange problem: how hard is it to find a donor?
- The optimal timing of living-donor liver transplantation
This page was built for publication: Efficiency in lung transplant allocation strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044231)