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

医院/居民问题中的社会稳定匹配

Socially stable matchings in the Hospitals / Residents problem

Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove, Emmanouil Pountourakis

摘要:

在医院/居民(HR)问题中,代理人被划分为医院和居民。每个代理都希望与另一组中的代理相匹配,并且对这些潜在的匹配具有严格的偏好。如果没有阻塞对,则匹配是稳定的,即,没有一对代理人喜欢彼此而不是分配给他们的比赛。这种情况是不期望的,因为它可能导致其中阻塞对在匹配之外形成私有布置的偏差。然而,这是假设阻止对有社会关系或沟通渠道,以促进偏离。放宽稳定性的定义,考虑到潜在的缺乏社会关系的代理可以产生更大的稳定匹配。在本文中,我们定义了社会稳定(HRSS)下的医院/居民问题,考虑到代理之间的社会联系,通过引入社会网络图的人力资源问题。社交网络图中的边对应于HR实例中彼此认识的居民-医院对。在社交网络图中不具有对应边的对可以属于匹配M,但它们永远不能阻止M。相对于一个宽松的稳定性定义HRSS,称为社会稳定,我们表明,社会稳定的匹配可以有不同的大小和找到一个最大的社会稳定匹配的问题是NP-难的,虽然近似在3/2。此外,我们还给出了问题的三种特殊情况的多项式时间算法。

英文摘要:

In the Hospitals/Residents (HR) problem, agents are partitioned into hospitals and residents. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking pairs, i.e., no pair of agents that prefer each other to their assigned matches. Such a situation is undesirable as it could lead to a deviation in which the blocking pair form a private arrangement outside the matching. This however assumes that the blocking pair have social ties or communication channels to facilitate the deviation. Relaxing the stability definition to take account of the potential lack of social ties between agents can yield larger stable matchings. In this paper, we define the Hospitals/Residents problem under Social Stability (HRSS) which takes into account social ties between agents by introducing a social network graph to the HR problem. Edges in the social network graph correspond to resident-hospital pairs in the HR instance that know one another. Pairs that do not have corresponding edges in the social network graph can belong to a matching M but they can never block M. Relative to a relaxed stability definition for HRSS, called social stability, we show that socially stable matchings can have different sizes and the problem of finding a maximum socially stable matching is NP-hard, though approximable within 3/2. Furthermore we give polynomial time algorithms for three special cases of the problem.

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

↑