arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.01769cs.GT
收藏

多胜者赞成投票中的平局问题

Ties in Multiwinner Approval Voting

Łukasz Janeczko, Piotr Faliszewski

AI总结:

该研究分析了多胜者赞成投票中平局判定与平局获胜委员会计数的计算复杂度,针对多数规则证明其难度高,为序贯规则提出以委员会规模为参数的FPT平局发现算法,并通过实验证实中等规模选举中平局较为常见。

摘要:

我们研究了判定给定的基于赞成制的多胜者选举中是否存在平局的复杂度,以及计算平局获胜委员会数量的复杂度。我们考虑了一类Thiele规则(蒂勒规则)及其贪心变体、Phragmen序贯规则(普拉格门序贯规则)和Method of Equal Shares(均摊法)。在大多数情况下,这些问题的计算难度很高,但针对序贯规则,我们提出了一种用于发现平局的FPT算法(以委员会规模为参数)。我们还通过实验表明,在中等规模的选举中,平局相当常见。

英文摘要:

We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We consider a family of Thiele rules, their greedy variants, Phragmen's sequential rule, and Method of Equal Shares. For most cases, our problems are computationally hard, but for sequential rules we find an FPT algorithm for discovering ties (parameterized by the committee size). We also show experimentally that in elections of moderate size ties are quite frequent.

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

↑