arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.00474cs.GTcs.DS
收藏

在两个交叉选举中投票

Voting in Two-Crossing Elections

Andrei Constantinescu, Roger Wattenhofer

摘要:

我们引入两个交叉选举作为单交叉选举的推广,展示了一些新的结果。首先,我们证明了两个交叉选举可以在多项式时间内识别,通过减少到研究的连续的问题。我们还推测,认识到$k$跨越选举是NP完全的一般情况下,提供证据有关的一个问题,连续的被证明是很难在文献中。单交叉选举表现出传递的多数关系,从许多重要的结果如下。另一方面,我们证明了经典的Debord-McGarvey定理仍然可以证明两个交叉,这意味着任何加权多数竞赛是诱导的两个交叉选举。这表明,许多投票规则在两个交叉选举下都是NP困难的,包括Kemeny和Slater。这与单交叉的情况相反,并概述了单交叉和双交叉之间的重要复杂性边界。随后,我们表明,两个交叉选举的所有候选人的杨氏分数可以计算在多项式时间,制定一个完全么模线性规划。最后,我们考虑了Chamberlin-Courant规则与任意disutilities和显示,一个获胜的委员会可以计算在多项式时间内,使用基于动态规划的方法。

英文摘要:

We introduce two-crossing elections as a generalization of single-crossing elections, showing a number of new results. First, we show that two-crossing elections can be recognized in polynomial time, by reduction to the well-studied consecutive ones problem. We also conjecture that recognizing $k$-crossing elections is NP-complete in general, providing evidence by relating to a problem similar to consecutive ones proven to be hard in the literature. Single-crossing elections exhibit a transitive majority relation, from which many important results follow. On the other hand, we show that the classical Debord-McGarvey theorem can still be proven two-crossing, implying that any weighted majority tournament is inducible by a two-crossing election. This shows that many voting rules are NP-hard under two-crossing elections, including Kemeny and Slater. This is in contrast to the single-crossing case and outlines an important complexity boundary between single- and two-crossing. Subsequently, we show that for two-crossing elections the Young scores of all candidates can be computed in polynomial time, by formulating a totally unimodular linear program. Finally, we consider the Chamberlin-Courant rule with arbitrary disutilities and show that a winning committee can be computed in polynomial time, using an approach based on dynamic programming.

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

↑