arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.00616cs.GTcs.AIecon.TH
收藏

稳定投票与循环的分裂

Stable Voting and the Splitting of Cycles

Wesley H. Holliday, Milan Mossé, Chase Norman, Eric Pacuit, Cynthia Wang

AI总结:

本文证明了在最多6个选项的情况下,简单稳定投票是Split Cycle的改进,但在超过6个选项时推翻了这一猜想。

摘要:

在计算社会选择中,解决多数循环偏好聚合的算法已被广泛研究。几种复杂的循环解决方法,包括蒂曼的排序对、施鲁兹的击败路径和海茨的河流,都是对Split Cycle(SC)方法的改进,该方法通过在每个循环中丢弃最弱的多数胜利来解决多数循环。最近,霍利戴和帕基特提出了一种新的SC方法的改进,称为稳定投票,并提出了一种简化版本,称为简单稳定投票(SSV)。他们推测,当没有两个多数胜利具有相同大小时,SSV是SC的改进。在本文中,我们证明了这一猜想在最多6个替代方案的情况下成立,并在超过6个替代方案的情况下推翻了这一猜想。虽然我们对最多5个替代方案的猜想证明使用了传统的数学推理,但我们的6个替代方案证明和7个替代方案的反例是通过使用SAT求解得到的。支撑这一证明和反例的SAT编码适用于远超SC和SSV的范围:它可以用于测试任何投票方法的性质,其胜者选择仅取决于按胜利幅度大小排序的顺序。

英文摘要:

Algorithms for resolving majority cycles in preference aggregation have been studied extensively in computational social choice. Several sophisticated cycle-resolving methods, including Tideman's Ranked Pairs, Schulze's Beat Path, and Heitzig's River, are refinements of the Split Cycle (SC) method that resolves majority cycles by discarding the weakest majority victories in each cycle. Recently, Holliday and Pacuit proposed a new refinement of Split Cycle, dubbed Stable Voting, and a simplification thereof, called Simple Stable Voting (SSV). They conjectured that SSV is a refinement of SC whenever no two majority victories are of the same size. In this paper, we prove the conjecture up to 6 alternatives and refute it for more than 6 alternatives. While our proof of the conjecture for up to 5 alternatives uses traditional mathematical reasoning, our 6-alternative proof and 7-alternative counterexample were obtained with the use of SAT solving. The SAT encoding underlying this proof and counterexample is applicable far beyond SC and SSV: it can be used to test properties of any voting method whose choice of winners depends only on the ordering of margins of victory by size.

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

↑