近似防策略竞赛规则:关于大操纵集和覆盖一致性
Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence
摘要:
我们考虑的可操作性的比赛规则,其中$n$队打循环赛和一个赢家(可能是随机的)选择的基础上,所有$\binom{n}{2}$比赛的结果。先前的工作定义了一个比赛规则是$k$ -SNM- $α$,如果没有一组$\leq k$球队可以固定它们之间的$\leq \binom{k}{2}$比赛,以增加他们通过$>α$获胜的概率,并问:对于每个$k$,最小的$α(k)$是什么,这样一个孔多塞一致的(即总是选择一个孔多塞冠军时,存在)$k$ -SNM- $α(k)$比赛规则存在?一个简单的例子证明,对于所有的$k$,$α(k) \geq \frac{k-1}{2k-1}$和[Schneider等人,2017]证明这是紧的(并证明它对$k=2$是紧的)。我们的第一个结果反驳了这个猜想:存在一个足够大的$k$,使得没有孔一致的竞赛规则是$k$-SNM- $1/2$。我们的第二个结果利用类似的机制来设计一个新的锦标赛规则,该规则是针对所有$k$的$k$ -SNM- $2/3$(并且这是针对所有$k$的第一个锦标赛规则,该规则是$k$ -SNM- $(<1)$)。我们的最终结果扩展了先前的工作,其证明了具有随机播种的单消除括号是$2$-SNM- $1/3$([Schneider等人,2017]),在不同的方向,通过寻求比孔多塞一致性更强的公平概念。我们设计了一个新的锦标赛规则,我们称之为随机之王的山,这是$2$ -SNM- $1/3$和\emph{cover-consistent}(获胜者是一个未覆盖的团队概率$1$)。
英文摘要:
We consider the manipulability of tournament rules, in which $n$ teams play a round robin tournament and a winner is (possibly randomly) selected based on the outcome of all $\binom{n}{2}$ matches. Prior work defines a tournament rule to be $k$-SNM-$α$ if no set of $\leq k$ teams can fix the $\leq \binom{k}{2}$ matches among them to increase their probability of winning by $>α$ and asks: for each $k$, what is the minimum $α(k)$ such that a Condorcet-consistent (i.e. always selects a Condorcet winner when one exists) $k$-SNM-$α(k)$ tournament rule exists? A simple example witnesses that $α(k) \geq \frac{k-1}{2k-1}$ for all $k$, and [Schneider et al., 2017] conjectures that this is tight (and prove it is tight for $k=2$). Our first result refutes this conjecture: there exists a sufficiently large $k$ such that no Condorcet-consistent tournament rule is $k$-SNM-$1/2$. Our second result leverages similar machinery to design a new tournament rule which is $k$-SNM-$2/3$ for all $k$ (and this is the first tournament rule which is $k$-SNM-$(<1)$ for all $k$). Our final result extends prior work, which proves that single-elimination bracket with random seeding is $2$-SNM-$1/3$([Schneider et al., 2017]), in a different direction by seeking a stronger notion of fairness than Condorcet-consistence. We design a new tournament rule, which we call Randomized-King-of-the-Hill, which is $2$-SNM-$1/3$ and \emph{cover-consistent} (the winner is an uncovered team with probability $1$).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。