Policy Optimization for Dynamic Heart Transplant Allocation

• URL: http://arxiv.org/abs/2512.12497v1
• Date: Sat, 13 Dec 2025 23:51:31 GMT
• Title: Policy Optimization for Dynamic Heart Transplant Allocation
• Authors: Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm,
• Abstract summary: Heart transplantation is a viable path for patients suffering from advanced heart failure.<n>The current allocation policy does not adequately take into account pretransplant and post-transplant mortality.<n>We develop a new simulator that enables us to evaluate and compare the performance of different policies.
• Score: 48.56507763517103
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Heart transplantation is a viable path for patients suffering from advanced heart failure, but this lifesaving option is severely limited due to donor shortage. Although the current allocation policy was recently revised in 2018, a major concern is that it does not adequately take into account pretransplant and post-transplant mortality. In this paper, we take an important step toward addressing these deficiencies. To begin with, we use historical data from UNOS to develop a new simulator that enables us to evaluate and compare the performance of different policies. We then leverage our simulator to demonstrate that the status quo policy is considerably inferior to the myopic policy that matches incoming donors to the patient who maximizes the number of years gained by the transplant. Moreover, we develop improved policies that account for the dynamic nature of the allocation process through the use of potentials -- a measure of a patient's utility in future allocations that we introduce. We also show that batching together even a handful of donors -- which is a viable option for a certain type of donors -- further enhances performance. Our simulator also allows us to evaluate the effect of critical, and often unexplored, factors in the allocation, such as geographic proximity and the tendency to reject offers by the transplant centers.

Related papers

• Learning Potentials for Dynamic Matching and Application to Heart Transplantation [45.83272225462161]
  We propose a novel framework for non-myopic policy optimization in general online matching relying on potentials.<n>Our approach is a form of self-supervised imitation learning: the potentials are trained to mimic an algorithm that has perfect foresight.
  arXiv  Detail & Related papers  (2026-02-09T16:39:12Z)
• Optimizing Hard-to-Place Kidney Allocation: A Machine Learning Approach to Center Ranking [0.4893345190925178]
  This paper proposes a data-driven, machine learning-based ranking system for allocating hard-to-place kidneys to centers. Our experiments demonstrate that the proposed policy can reduce the average number of centers considered before placement by fourfold for all kidneys and tenfold for hard-to-place kidneys.
  arXiv  Detail & Related papers  (2024-10-10T17:15:41Z)
• Deep State-Space Generative Model For Correlated Time-to-Event Predictions [54.3637600983898]
  We propose a deep latent state-space generative model to capture the interactions among different types of correlated clinical events. Our method also uncovers meaningful insights about the latent correlations among mortality and different types of organ failures.
  arXiv  Detail & Related papers  (2024-07-28T02:42:36Z)
• Pruning the Way to Reliable Policies: A Multi-Objective Deep Q-Learning Approach to Critical Care [46.2482873419289]
  We introduce a deep Q-learning approach to obtain more reliable critical care policies. We evaluate our method in off-policy and offline settings using simulated environments and real health records from intensive care units.
  arXiv  Detail & Related papers  (2023-06-13T18:02:57Z)
• Policy Learning with Asymmetric Counterfactual Utilities [0.6138671548064356]
  We consider optimal policy learning with asymmetric counterfactual utility functions. We derive minimax decision rules by minimizing the maximum expected utility loss. We show that one can learn minimax loss decision rules from observed data by solving intermediate classification problems.
  arXiv  Detail & Related papers  (2022-06-21T15:44:49Z)
• Practical Challenges in Differentially-Private Federated Survival Analysis of Medical Data [57.19441629270029]
  In this paper, we take advantage of the inherent properties of neural networks to federate the process of training of survival analysis models. In the realistic setting of small medical datasets and only a few data centers, this noise makes it harder for the models to converge. We propose DPFed-post which adds a post-processing stage to the private federated learning scheme.
  arXiv  Detail & Related papers  (2022-02-08T10:03:24Z)
• Optimal discharge of patients from intensive care via a data-driven policy learning framework [58.720142291102135]
  It is important that the patient discharge task addresses the nuanced trade-off between decreasing a patient's length of stay and the risk of readmission or even death following the discharge decision. This work introduces an end-to-end general framework for capturing this trade-off to recommend optimal discharge timing decisions. A data-driven approach is used to derive a parsimonious, discrete state space representation that captures a patient's physiological condition.
  arXiv  Detail & Related papers  (2021-12-17T04:39:33Z)
• Learning $\mathbf{\mathit{Matching}}$ Representations for Individualized Organ Transplantation Allocation [98.43063331640538]
  We formulate the problem of learning data-driven rules for organ matching using observational data for organ allocations and transplant outcomes. We propose a model based on representation learning to predict donor-recipient compatibility. Our model outperforms state-of-art allocation methods and policies executed by human experts.
  arXiv  Detail & Related papers  (2021-01-28T01:33:21Z)
• Counterfactually Guided Off-policy Transfer in Clinical Settings [7.313613282363874]
  We propose a method for off-policy transfer by modeling the underlying generative process with a causal mechanism. We demonstrate how this addresses data-scarcity in the presence of unobserved confounding.
  arXiv  Detail & Related papers  (2020-06-20T20:36:56Z)
• Robust Policies For Proactive ICU Transfers [3.9286045166400685]
  Patients whose transfer to the Intensive Care Unit (ICU) is unplanned are prone to higher mortality rates than those who were admitted directly to the ICU. Recent advances in machine learning to predict patient deterioration have introduced the possibility of emphproactive transfer from the ward to the ICU. We study the problem of finding emphrobust patient transfer policies which account for uncertainty in statistical estimates due to data limitations when optimizing to improve overall patient care.
  arXiv  Detail & Related papers  (2020-02-14T21:07:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.