通过粗化实现近优动态匹配:应用于心脏移植的应用
Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
AI总结:
本文提出基于粗化方法的近优动态匹配算法,应用于心脏移植分配,通过理论支撑政策在模拟中取得优于现状政策的性能。
摘要:
在线匹配在互联网广告和器官分配等领域已成为主流,但实际算法往往缺乏强有力的理论保证。我们通过开发基于粗化方法的新在线匹配算法迈出重要一步。尽管粗化通常意味着粒度的损失,但我们证明,将离线节点聚合到具有容量的集群中可以产生接近最优的理论保证。我们应用我们的方法到心脏移植分配,以开发基于历史数据结构性质的理论支撑政策。此外,在基于真实数据的模拟中,我们的政策接近于 omniscient 预测基准的性能,达到 0.91 的竞争比率,远高于美国现状政策的 0.51。我们的工作弥合了数据驱动启发式方法与悲观理论下限之间的差距。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。