Learning Potentials for Dynamic Matching and Application to Heart Transplantation

📅 2026-02-09
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Current heart transplant allocation policies suffer from suboptimal population-level efficiency due to their inability to effectively respond to the dynamic arrival of donor organs and evolving characteristics of waitlisted candidates. This work proposes a far-sighted online matching framework grounded in potential-based decision-making, introducing for the first time a high-dimensional, highly expressive potential function trained via self-supervised imitation learning to approximate the oracle policy with perfect foresight. By striking a balance between theoretical rigor and computational scalability, the proposed method significantly outperforms both the current U.S. allocation policy and state-of-the-art continuous allocation frameworks on real-world heart transplant data, yielding substantial improvements in key outcomes such as overall patient survival rates.

Technology Category

Application Category

📝 Abstract
Each year, thousands of patients in need of heart transplants face life-threatening wait times due to organ scarcity. While allocation policies aim to maximize population-level outcomes, current approaches often fail to account for the dynamic arrival of organs and the composition of waitlisted candidates, thereby hampering efficiency. The United States is transitioning from rigid, rule-based allocation to more flexible data-driven models. In this paper, we propose a novel framework for non-myopic policy optimization in general online matching relying on potentials, a concept originally introduced for kidney exchange. We develop scalable and accurate ways of learning potentials that are higher-dimensional and more expressive than prior approaches. Our approach is a form of self-supervised imitation learning: the potentials are trained to mimic an omniscient algorithm that has perfect foresight. We focus on the application of heart transplant allocation and demonstrate, using real historical data, that our policies significantly outperform prior approaches -- including the current US status quo policy and the proposed continuous distribution framework -- in optimizing for population-level outcomes. Our analysis and methods come at a pivotal moment in US policy, as the current heart transplant allocation system is under review. We propose a scalable and theoretically grounded path toward more effective organ allocation.
Problem

Research questions and friction points this paper is trying to address.

dynamic matching
organ allocation
heart transplantation
online matching
policy optimization
Innovation

Methods, ideas, or system contributions that make the work stand out.

potentials
non-myopic policy optimization
online matching
self-supervised imitation learning
dynamic organ allocation
🔎 Similar Papers
No similar papers found.
I
Itai Zilberstein
Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Ioannis Anagnostides
Ioannis Anagnostides
PhD student, Carnegie Mellon University
Theoretical Computer ScienceGame TheoryMachine Learning
Z
Zachary W. Sollie
Department of Surgery, Division of Cardiothoracic Surgery, Medical University of South Carolina, Charleston, SC
A
Arman Kilic
Department of Surgery, Division of Cardiothoracic Surgery, Medical University of South Carolina, Charleston, SC
Tuomas Sandholm
Tuomas Sandholm
Angel Jordan University Professor of Computer Science, Carnegie Mellon University
Artificial intelligenceauctionsmarket designgame theorymechanism design