arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.03123cs.DScs.GT
收藏

带区域上限的医院/居民问题的精细计算复杂性

Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps

Koki Hamada, Shuichi Miyazaki

摘要:

医院/居民问题(HR)是一个多对一匹配问题,其解的概念是稳定性。它被广泛用于分配系统,如分配医学生(住院医生)到医院。为了解决分配到医院的住院医生人数不平衡的问题,引入了一个名为区域上限的HR(HRRC)的扩展。在这个问题中,一个正整数(称为区域上限)与一个医院子集(称为区域)相关联,并且分配给一个区域内医院的居民总数必须最多为其区域上限。Kamada和Kojima定义了HRRC的强稳定性,并证明了强稳定匹配不一定存在。最近,Aziz等人证明了判定强稳定匹配是否存在的问题一般是NP-完全的。在本文中,我们完善阿齐兹等人。的结果,通过调查的计算复杂性的问题的偏好列表的长度,区域的大小,以及是否区域可以重叠,并完全分类听话和棘手的情况下。

英文摘要:

The Hospitals/Residents problem (HR) is a many-to-one matching problem whose solution concept is stability. It is widely used in assignment systems such as assigning medical students (residents) to hospitals. To resolve imbalance in the number of residents assigned to hospitals, an extension called HR with regional caps (HRRC) was introduced. In this problem, a positive integer (called a regional cap) is associated with a subset of hospitals (called a region), and the total number of residents assigned to hospitals in a region must be at most its regional cap. Kamada and Kojima defined strong stability for HRRC and demonstrated that a strongly stable matching does not necessarily exist. Recently, Aziz et al. proved that the problem of determining if a strongly stable matching exists is NP-complete in general. In this paper, we refine Aziz et al.'s result by investigating the computational complexity of the problem in terms of the length of preference lists, the size of regions, and whether or not regions can overlap, and completely classify tractable and intractable cases.

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

↑