随机死亡竞赛中三队操纵的紧界
Tight Bounds on 3-Team Manipulations in Randomized Death Match
摘要:
考虑一个n支球队的循环赛,其中获胜者必须(可能是随机的)根据${n \choose 2}$成对比赛的结果来选择。一个锦标赛规则被称为k-SNM- $α$,如果没有一组k支球队可以操纵它们之间的${k \choose 2}$成对匹配,以提高2这k支球队之一获胜的联合概率超过$α$。先前的工作确定了多个简单的锦标赛规则2-SNM-1/3(随机单淘汰赛[SSW 17],随机山丘之王[SWZZ 20],随机死亡比赛[DW 21]),这是所有孔多塞一致规则中k = 2的最佳规则(即选择概率为1的不败球队的规则)。我们的主要结果确定了随机死亡匹配是3-SNM-(31/60),这是紧的(对于随机死亡匹配)。这是第一次严格分析任何孔一致的比赛规则和至少三个操纵球队。我们的证明方法在这一领域是新颖的:我们明确地找到最可操纵的比赛,并直接表明,没有其他比赛可以更操纵。除了我们的主要结果,我们还确定了随机死亡比赛抑制了Sybil攻击(一个团队将自己的多个副本输入比赛,并任意操纵副本之间的比赛结果)。具体来说,对于任何锦标赛,以及任何不是孔多塞冠军的队伍u,当Sybil的数量接近$\infty$时,u或其Sybil之一在随机死亡比赛中获胜的概率接近0。
英文摘要:
Consider a round-robin tournament on n teams, where a winner must be (possibly randomly) selected as a function of the results from the ${n \choose 2}$ pairwise matches. A tournament rule is said to be k-SNM-$α$ if no set of k teams can ever manipulate the ${k \choose 2}$ pairwise matches between them to improve 2 the joint probability that one of these k teams wins by more than $α$. Prior work identifies multiple simple tournament rules that are 2-SNM-1/3 (Randomized Single Elimination Bracket [SSW17], Randomized King of the Hill [SWZZ20], Randomized Death Match [DW21]), which is optimal for k = 2 among all Condorcet-consistent rules (that is, rules that select an undefeated team with probability 1). Our main result establishes that Randomized Death Match is 3-SNM-(31/60), which is tight (for Randomized Death Match). This is the first tight analysis of any Condorcet-consistent tournament rule and at least three manipulating teams. Our proof approach is novel in this domain: we explicitly find the most-manipulable tournament, and directly show that no other tournament can be more manipulable. In addition to our main result, we establish that Randomized Death Match disincentivizes Sybil attacks (where a team enters multiple copies of themselves into the tournament, and arbitrarily manipulates the outcomes of matches between their copies). Specifically, for any tournament, and any team u that is not a Condorcet winner, the probability that u or one of its Sybils wins in Randomized Death Match approaches 0 as the number of Sybils approaches $\infty$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。