带加权投票者的流行匹配问题
Popular matchings with weighted voters
AI总结:
本文研究带权顶点的流行匹配问题,证明一般加权场景下找流行匹配是NP难的,并给出二分图两侧顶点权重分别为c>3和1时的多项式时间求解或不存在性证明算法。
摘要:
在流行匹配(Popular Matching)问题中,给定二分图$G = (A \cup B, E)$,且每个顶点$v\in A\cup B$对其邻居有严格偏好序。给定两个匹配$M$和$M'$,若偏好$M$甚于$M'$的顶点数量多于偏好$M'$甚于$M$的顶点数量,则称匹配$M$比$M'$更流行。若不存在比匹配$M$更流行的匹配$M'$,则称$M$为流行匹配。\n 我们研究流行匹配问题的一种自然推广形式:每个顶点都带有权重。此时,若偏好$M$甚于$M'$的顶点权重之和大于偏好$M'$甚于$M$的顶点权重之和,则称匹配$M$比$M'$更流行。我们证明,在该加权场景下,寻找流行匹配是NP难的。我们的核心结果是一种多项式时间算法,当二分图一侧所有顶点的权重均为$c > 3$、另一侧所有顶点权重均为1时,该算法要么给出一个流行匹配,要么证明该实例不存在流行匹配。
英文摘要:
In the Popular Matching problem, we are given a bipartite graph $G = (A \cup B, E)$ and for each vertex $v\in A\cup B$, strict preferences over the neighbors of $v$. Given two matchings $M$ and $M'$, matching $M$ is more popular than $M'$ if the number of vertices preferring $M$ to $M'$ is larger than the number of vertices preferring $M'$ to $M$. A matching $M$ is called popular if there is no matching $M'$ that is more popular than $M$. We consider a natural generalization of Popular Matching where every vertex has a weight. Then, we call a matching $M$ more popular than matching $M'$ if the weight of vertices preferring $M$ to $M'$ is larger than the weight of vertices preferring $M'$ to $M$. For this case, we show that it is NP-hard to find a popular matching. Our main result its a polynomial-time algorithm that delivers a popular matching or a proof for it non-existence in instances where all vertices on one side have weight $c > 3$ and all vertices on the other side have weight 1.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。