加权锦标赛解的胜差(Margin of Victory)
Margin of Victory for Weighted Tournament Solutions
AI总结:
该研究将锦标赛解的胜差概念推广至加权锦标赛解场景,分析三种加权锦标赛解的胜差可计算性与取值上下界,并完成相关性质的公理化推广,为计算社会选择领域的选举结果稳定性分析提供支撑。
摘要:
确定选举中的获胜者距离落败有多近,或是区分选举中不同的可能获胜者,是计算社会选择领域的核心问题。我们针对所谓的加权锦标赛解展开研究,将Brill等人提出的锦标赛解的胜差(MoV,Margin of Victory)概念推广至加权锦标赛解场景。对于加权锦标赛解,获胜者(对应地,落败者)的MoV指的是锦标赛中需要调整的总权重,以使其变为落败者(对应地,获胜者)。我们研究了三种加权锦标赛解:Borda法则、加权Uncovered Set(未覆盖集)和Split Cycle(分裂循环)。针对这三种规则,我们明确了获胜者与非获胜者的MoV是否具备可计算性,并给出了MoV可能取值的上下界。此外,我们还从公理层面展开研究,将无加权锦标赛场景下的性质推广至加权锦标赛场景。
英文摘要:
Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted tournament solutions by generalizing the notion of margin of victory (MoV) for tournament solutions by Brill et. al to weighted tournament solutions. For these, the MoV of a winner (resp. loser) is the total weight that needs to be changed in the tournament to make them a loser (resp. winner). We study three weighted tournament solutions: Borda's rule, the weighted Uncovered Set, and Split Cycle. For all three rules, we determine whether the MoV for winners and non-winners is tractable and give upper and lower bounds on the possible values of the MoV. Further, we axiomatically study and generalize properties from the unweighted tournament setting to weighted tournaments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。