选举中政党下的必要总统
Necessary President in Elections with Parties
AI总结:
研究了选举中政党下的必要总统问题,发现其在不同投票规则下的计算复杂性,证明了其在某些规则下的$\mathsf{coNP}$-完全性和参数化难度。
摘要:
考虑一个选举,其中候选人的集合被划分为政党,每个政党必须选择恰好一个候选人作为选举的候选人。必要总统问题询问是否有一个候选人,如果被提名,将成为选举的所有可能提名情况下获胜者。我们研究了必要总统问题在几种投票规则下的计算复杂性。我们证明,尽管对于波尔达、最大最小值和柯普兰$^α$(对于每一个$α∈[0,1]$)规则,该问题可以在多项式时间内解决,但对于包含$ℓ$-批准和$ℓ$-否决的一般位置评分规则,该问题在最大政党大小为两个时仍然是$\mathsf{coNP}$-完全的。对于这类位置评分规则,我们证明必要总统问题在以政党数量为参数时是$\mathsf{W}[2]$-难的,但以选民类型数量为参数时是固定参数可解的。此外,我们证明对于排名对规则,必要总统问题即使在最大政党大小为两个时仍然是$\mathsf{coNP}$-完全的,并且对于政党数量而言是$\mathsf{W}[1]$-难的;值得注意的是,这两个结果甚至在选民数量为常数时也成立。
英文摘要:
Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees. The Necessary President problem asks whether a candidate, if nominated, becomes the winner of the election for all possible nominations from other parties. We study the computational complexity of Necessary President for several voting rules. We show that while this problem is solvable in polynomial time for Borda, Maximin, and Copeland$^α$ for every $α\in [0,1]$, it is $\mathsf{coNP}$-complete for general classes of positional scoring rules that include $\ell$-Approval and $\ell$-Veto, even when the maximum size of a party is two. For such positional scoring rules, we show that Necessary President is $\mathsf{W}[2]$-hard when parameterized by the number of parties, but fixed-parameter tractable with respect to the number of voter types. Additionally, we prove that Necessary President for Ranked Pairs is $\mathsf{coNP}$-complete even for maximum party size two, and $\mathsf{W}[1]$-hard with respect to the number of parties; remarkably, both of these results hold even for constant number of voters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。