具有单边偏差的流行匹配
Popular Matchings with One-Sided Bias
摘要:
令$G = (A \cup B,E)$是一个二部图,其中集合$A$由代理人或主要参与者组成,集合$B$由作业或次要参与者组成。每一个顶点都有一个严格的邻居排名。如果对于任何匹配的$N$,偏好$M$而不是$N$的顶点数至少等于偏好$N$而不是$M$的顶点数,则匹配的$M$是流行的。流行的匹配总是存在于$G$中,因为每个稳定的匹配都是流行的。匹配的$M$是$A$ -流行的,如果对于任何匹配的$N$,代理的数量(即,优选$M$而不是$N$的$A$中的顶点)的数目至少是优选$N$而不是$M$的代理的数目。与流行匹配不同,$A$ -流行匹配不需要存在于给定实例$G$中,并且存在简单的线性时间算法来判定$G$是否允许$A$ -流行匹配,并且如果允许,则计算一个。我们考虑的问题,决定是否$G$承认一个匹配,既流行和$A$ -流行,并找到一个,如果是这样的。我们称这种配对为完全受欢迎。当$A$是更重要的一方时,一个完全流行的匹配是有用的--所以随着整体流行度的增加,我们希望保持“$A$集内的流行度”。完全流行匹配不一定是最小尺寸/最大尺寸流行匹配,并且用于流行匹配问题的所有已知多项式时间算法计算最小尺寸或最大尺寸流行匹配。在这里,我们展示了一个线性时间算法的完全流行的匹配问题,因此我们的结果显示了一个新的易处理的子类流行的匹配。
英文摘要:
Let $G = (A \cup B,E)$ be a bipartite graph where the set $A$ consists of agents or main players and the set $B$ consists of jobs or secondary players. Every vertex has a strict ranking of its neighbors. A matching $M$ is popular if for any matching $N$, the number of vertices that prefer $M$ to $N$ is at least the number that prefer $N$ to $M$. Popular matchings always exist in $G$ since every stable matching is popular. A matching $M$ is $A$-popular if for any matching $N$, the number of agents (i.e., vertices in $A$) that prefer $M$ to $N$ is at least the number of agents that prefer $N$ to $M$. Unlike popular matchings, $A$-popular matchings need not exist in a given instance $G$ and there is a simple linear time algorithm to decide if $G$ admits an $A$-popular matching and compute one, if so. We consider the problem of deciding if $G$ admits a matching that is both popular and $A$-popular and finding one, if so. We call such matchings fully popular. A fully popular matching is useful when $A$ is the more important side -- so along with overall popularity, we would like to maintain ``popularity within the set $A$''. A fully popular matching is not necessarily a min-size/max-size popular matching and all known polynomial-time algorithms for popular matching problems compute either min-size or max-size popular matchings. Here we show a linear time algorithm for the fully popular matching problem, thus our result shows a new tractable subclass of popular matchings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。