确定Slater优胜者对于并行访问NP是完全的
Determining a Slater Winner is Complete for Parallel Access to NP
摘要:
我们考虑的复杂性,决定在斯莱特规则下的选举获胜者。在这种情况下,我们给出了一个锦标赛$T = (V, A)$,其中V的顶点代表候选人,每个弧的方向指示两个端点中的哪一个对大多数投票者更有利。顶点$v\in V$的Slater分数被定义为需要反转的弧的最小数目,使得$T$变为非循环的并且$v$变为获胜者。如果$v$在$T$中具有最低Slater得分,则我们说$v$在$T$中是Slater获胜者。决定一个顶点在锦标赛中是否是斯莱特冠军一直被认为是NP困难的。然而,这个问题最著名的复杂性上限是类$Θ_2^p$,它对应于多项式时间图灵机与并行访问NP oracle。在本文中,我们关闭这一差距表明,这个问题是$Θ_2^p$ -完整的,这种硬度适用于实例建设聚合的偏好7选民。
英文摘要:
We consider the complexity of deciding the winner of an election under the Slater rule. In this setting we are given a tournament $T = (V, A)$, where the vertices of V represent candidates and the direction of each arc indicates which of the two endpoints is preferable for the majority of voters. The Slater score of a vertex $v\in V$ is defined as the minimum number of arcs that need to be reversed so that $T$ becomes acyclic and $v$ becomes the winner. We say that $v$ is a Slater winner in $T$ if $v$ has minimum Slater score in $T$. Deciding if a vertex is a Slater winner in a tournament has long been known to be NP-hard. However, the best known complexity upper bound for this problem is the class $Θ_2^p$, which corresponds to polynomial-time Turing machines with parallel access to an NP oracle. In this paper we close this gap by showing that the problem is $Θ_2^p$-complete, and that this hardness applies to instances constructible by aggregating the preferences of 7 voters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。