arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.01956cs.DS
收藏

医院/住院医生中的“几乎稳定”匹配与夫妇问题

"Almost-stable" matchings in the Hospitals / Residents problem with Couples

David F. Manlove, Iain McBride, James Trimble

摘要:

夫妇医院/居民问题(HRC)模型的分配打算初级医生的医院,夫妇被允许提交联合偏好列表对(通常是地理上接近)的医院。已知不需要存在稳定的匹配,因此我们考虑MIN BP HRC,即找到允许最小数量的阻塞对(即,“尽可能稳定”。我们证明,这个问题是NP难的,即使在每对夫妇只能接受一对医院的高度限制的情况下,也很难近似。然而,如果我们进一步假设,每个单一的居民和医院的偏好列表的长度最多为2,我们给这种情况下的多项式时间算法。然后,我们提出了第一个可编程(IP)和约束规划(CP)模型的最小BP人权。最后,我们讨论了这些模型应用于随机生成的MIN BP HRC的实例的实证评估。我们发现,平均而言,CP模型比IP模型快约1.15倍,当预求解应用于CP模型时,它平均快8.14倍。我们进一步观察到,一个解所允许的阻塞对的数量非常小,即,对于所考虑的(28,000)个实例,通常最多为1个,并且从不超过2个。

英文摘要:

The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider MIN BP HRC, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is "as stable as possible"). We show that this problem is NP-hard and difficult to approximate even in the highly restricted case that each couple finds only one hospital pair acceptable. However if we further assume that the preference list of each single resident and hospital is of length at most 2, we give a polynomial-time algorithm for this case. We then present the first Integer Programming (IP) and Constraint Programming (CP) models for MIN BP HRC. Finally, we discuss an empirical evaluation of these models applied to randomly-generated instances of MIN BP HRC. We find that on average, the CP model is about 1.15 times faster than the IP model, and when presolving is applied to the CP model, it is on average 8.14 times faster. We further observe that the number of blocking pairs admitted by a solution is very small, i.e., usually at most 1, and never more than 2, for the (28,000) instances considered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑