平衡淘汰赛中的稳健平局
Robust Draws in Balanced Knockout Tournaments
摘要:
平衡淘汰赛在体育比赛中无处不在,也用于决策和选举。传统的计算问题,要求计算一个平局(最佳平局),最大限度地提高了一个杰出的球员的获胜概率,已经得到了很多关注。以前的作品考虑的问题,成对的获胜概率是已知的,而我们研究如何强大的是获胜概率相对于成对的获胜概率中的小错误。首先,我们提出了几个有启发性的例子来建立:(a)存在确定性比赛(成对获胜概率为~0或~1),其中一个最佳抽签比另一个更鲁棒;(b)一般来说,存在比所有最佳抽签更鲁棒的次优抽签的比赛。上述例子激发了对保证指定获胜概率的稳健平局的计算问题的研究。其次,我们提出了一个多项式时间算法近似的鲁棒性绘制足够小的错误成对获胜概率,并获得所述计算问题是NP-完全的。我们还表明,两个自然的情况下,确定性比赛的最佳提请可以计算在多项式时间也承认多项式时间算法来计算强大的最佳提请。
英文摘要:
Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a)~there exist deterministic tournaments (where the pairwise winning probabilities are~0 or~1) where one optimal draw is much more robust than the other; and (b)~in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。