Abstract
Currently in the United States, lung transplantations are allocated to candidates according to each candidate’s 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 expectancies 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 (state, time) 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 extend the results to the allocation and matching of multiple organ types.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.