基于蒙特卡罗树搜索的住院医师随时扩容匹配
Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search
摘要:
本文考虑了双边匹配中的容量扩张问题,其中决策者被允许分配一些额外的座位以及标准座位。在住院医师比赛中,每家医院接受有限数量的医生。这种容量限制通常是预先给定的。然而,这种外生约束可能会损害医生的福利;一些受欢迎的医院不可避免地会解雇一些他们最喜欢的医生。与此同时,医院往往也会因为多收几名医生而受益。为了解决这个问题,我们提出了一个随时随地的方法,上置信树搜索空间的容量扩展,其中每一个都有一个居民最佳的稳定分配,延迟接受方法发现。构造一个好的搜索树表示显着提高所提出的方法的性能。我们的模拟结果表明,该方法确定了一个几乎最佳的容量扩展与一个显着较小的计算预算比精确的方法基于混合整数规划。
英文摘要:
This paper considers the capacity expansion problem in two-sided matchings, where the policymaker is allowed to allocate some extra seats as well as the standard seats. In medical residency match, each hospital accepts a limited number of doctors. Such capacity constraints are typically given in advance. However, such exogenous constraints can compromise the welfare of the doctors; some popular hospitals inevitably dismiss some of their favorite doctors. Meanwhile, it is often the case that the hospitals are also benefited to accept a few extra doctors. To tackle the problem, we propose an anytime method that the upper confidence tree searches the space of capacity expansions, each of which has a resident-optimal stable assignment that the deferred acceptance method finds. Constructing a good search tree representation significantly boosts the performance of the proposed method. Our simulation shows that the proposed method identifies an almost optimal capacity expansion with a significantly smaller computational budget than exact methods based on mixed-integer programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。