arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.14980cs.GTcs.AIcs.DM
收藏

最优多数规则与集合式Kemeny投票方案的定量Condorcet性质

Optimal majority rules and quantitative Condorcet properties of setwise Kemeny voting schemes

Université de Montréal(蒙特利尔大学)

Xuan Kien Phung, Sylvie Hamel

AI总结:

该研究针对Kemeny投票问题,建立经典Kemeny中位问题的最优定量扩展,分析3-wise Kemeny规则的量化公理性质,证明其优势并提出NP难问题的空间缩减技术,验证高阶集合式方案的价值。

摘要:

重要的Kemeny问题旨在计算符合Kemeny投票规则的选举中位共识排序,在生物学与计算社会选择领域有重要应用,近期Gilbert等人通过一种有趣的集合式方法对其进行了推广。我们的首批研究结果为经典Kemeny中位问题的一致性性质以及Betzler等人提出的著名3/4多数规则建立了最优定量扩展。此外,我们详尽梳理了3-wise Kemeny规则的一系列量化公理性质(如Condorcet准则、Smith准则、5/6多数规则等),该规则不仅考虑两两比较,还纳入了三个候选人子集的获胜者之间的不一致性。研究得出结论:由3-wise Kendall-tau距离诱导的3-wise Kemeny投票方案相较于经典Kemeny规则具有显著优势,例如满足多项改进后的抗操纵性质。由于3-wise Kemeny问题是NP难问题,我们的研究还通过确定备选方案对的相对顺序,提出了首批实用的空间缩减技术。我们的工作表明,更高阶的集合式Kemeny投票方案也具有类似的优良性质,这足以弥补其相较于经典Kemeny方案更高的计算成本。

英文摘要:

The important Kemeny problem, which consists of computing median consensus rankings of an election with respect to the Kemeny voting rule, admits important applications in biology and computational social choice and was generalized recently via an interesting setwise approach by Gilbert et. al. Our first results establish optimal quantitative extensions of the Unanimity property and the well-known $3/4$-majority rule of Betzler et al. for the classical Kemeny median problem. Moreover, by elaborating an exhaustive list of quantified axiomatic properties (such as the Condorcet and Smith criteria, the $5/6$-majority rule, etc.) of the $3$-wise Kemeny rule where not only pairwise comparisons but also the discordance between the winners of subsets of three candidates are also taken into account, we come to the conclusion that the $3$-wise Kemeny voting scheme induced by the $3$-wise Kendall-tau distance presents interesting advantages in comparison with the classical Kemeny rule. For example, it satisfies several improved manipulation-proof properties. Since the $3$-wise Kemeny problem is NP-hard, our results also provide some of the first useful space reduction techniques by determining the relative orders of pairs of alternatives. Our works suggest similar interesting properties of higher setwise Kemeny voting schemes which justify and compensate for the more expensive computational cost than the classical Kemeny scheme.

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

↑