婚姻与室友问题中的不受欢迎因素
Unpopularity Factor in the Marriage and Roommates Problems
摘要:
给定一组$A$的$n$的人,每个人都有一个偏好列表,排名的一个子集的$A$作为他/她的可接受的合作伙伴的偏好顺序,我们考虑的室友问题(RP)和婚姻问题(MP)的匹配人与他们的合作伙伴。在RP中,没有进一步的限制,而在MP中,只有异性才能成为可接受的伴侣。对于一对匹配$X$和$Y$,令$ϕ(X,Y)$表示与通过$Y$匹配的人相比更喜欢通过$X$匹配的人的人数,并将匹配$M$的不受欢迎因子$u(M)$定义为所有其他可能匹配$M'$中的最大比率$ϕ(M',M) / ϕ(M,M')$。在本文中,我们开发了一个算法来计算一个给定的匹配不受欢迎的因素在$O(m\sqrt{n}\log^2 n)$时间RP和在$O(m\sqrt{n}\log n)$时间MP,其中$m$是人们的偏好列表的总长度。我们还将不受欢迎因素的概念推广到加权设置,其中人们被赋予不同的投票权重,并表明我们的算法可以稍微修改以支持相同运行时间的设置。
英文摘要:
Given a set $A$ of $n$ people, with each person having a preference list that ranks a subset of $A$ as his/her acceptable partners in order of preference, we consider the Roommates Problem (RP) and the Marriage Problem (MP) of matching people with their partners. In RP there is no further restriction, while in MP only people of opposite genders can be acceptable partners. For a pair of matchings $X$ and $Y$, let $ϕ(X,Y)$ denote the number of people who prefer a person they get matched by $X$ to a person they get matched by $Y$, and define an unpopularity factor $u(M)$ of a matching $M$ to be the maximum ratio $ϕ(M',M) / ϕ(M,M')$ among all other possible matchings $M'$. In this paper, we develop an algorithm to compute the unpopularity factor of a given matching in $O(m\sqrt{n}\log^2 n)$ time for RP and in $O(m\sqrt{n}\log n)$ time for MP, where $m$ is the total length of people's preference lists. We also generalize the notion of unpopularity factor to a weighted setting where people are given different voting weights and show that our algorithm can be slightly modified to support that setting with the same running time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。