arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9907036cs.CC
收藏

Dodgson选举的精确分析:Lewis Carroll的1876年投票系统对于并行访问NP是完全的

Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP

Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe

摘要:

1876年,刘易斯·卡罗尔提出了一种投票制度,在这种制度中,获胜者是选民偏好变化最少的候选人,成为孔多塞获胜者-在成对多数规则选举中击败所有其他候选人的候选人。Bartholdi、Tovey和Trick在Carroll系统中确定选举获胜者的计算复杂性上提供了一个下界--NP-难度。我们提供了一个更强的下限和一个与我们的下限相匹配的上限。特别地,在Carroll的系统中确定获胜者对于并行访问NP是完全的,即,对于$\thetatwo$,它是完备的,对于$\thetatwo$,它成为已知的最自然的完备问题。因此,在卡罗尔的选举中确定获胜者不是NP完全的,除非多项式层次崩溃。

英文摘要:

In 1876, Lewis Carroll proposed a voting system in which the winner is the candidate who with the fewest changes in voters' preferences becomes a Condorcet winner---a candidate who beats all other candidates in pairwise majority-rule elections. Bartholdi, Tovey, and Trick provided a lower bound---NP-hardness---on the computational complexity of determining the election winner in Carroll's system. We provide a stronger lower bound and an upper bound that matches our lower bound. In particular, determining the winner in Carroll's system is complete for parallel access to NP, i.e., it is complete for $\thetatwo$, for which it becomes the most natural complete problem known. It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses.

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

↑