Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911425525448704 |
|---|---|
| author | Zilberstein, Itai Anagnostides, Ioannis Sollie, Zachary W. Kilic, Arman Sandholm, Tuomas |
| author_facet | Zilberstein, Itai Anagnostides, Ioannis Sollie, Zachary W. Kilic, Arman Sandholm, Tuomas |
| contents | Online matching has been a mainstay in domains such as Internet advertising and organ allocation, but practical algorithms often lack strong theoretical guarantees. We take an important step toward addressing this by developing new online matching algorithms based on a coarsening approach. Although coarsening typically implies a loss of granularity, we show that, to the contrary, aggregating offline nodes into capacitated clusters can yield near-optimal theoretical guarantees. We apply our methodology to heart transplant allocation to develop theoretically grounded policies based on structural properties of historical data. Furthermore, in simulations based on real data, our policy closely matches the performance of the omniscient benchmark, achieving competitive ratio 0.91, drastically higher than the US status quo policy's 0.51. Our work bridges the gap between data-driven heuristics and pessimistic theoretical lower bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_04989 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation Zilberstein, Itai Anagnostides, Ioannis Sollie, Zachary W. Kilic, Arman Sandholm, Tuomas Machine Learning Artificial Intelligence Online matching has been a mainstay in domains such as Internet advertising and organ allocation, but practical algorithms often lack strong theoretical guarantees. We take an important step toward addressing this by developing new online matching algorithms based on a coarsening approach. Although coarsening typically implies a loss of granularity, we show that, to the contrary, aggregating offline nodes into capacitated clusters can yield near-optimal theoretical guarantees. We apply our methodology to heart transplant allocation to develop theoretically grounded policies based on structural properties of historical data. Furthermore, in simulations based on real data, our policy closely matches the performance of the omniscient benchmark, achieving competitive ratio 0.91, drastically higher than the US status quo policy's 0.51. Our work bridges the gap between data-driven heuristics and pessimistic theoretical lower bounds. |
| title | Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2602.04989 |