arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.4724physics.soc-phcond-mat.stat-mech
收藏

竞争中的随机性

Randomness in Competitions

E. Ben-Naim, N. W. Hengartner, S. Redner, F. Vazquez

摘要:

我们研究了随机性对比赛的影响,基于一个基本的随机过程,其中有一个有限的概率,一个较弱的团队打乱了一个较强的团队。我们将此模型应用于体育联赛和体育锦标赛,并将理论结果与经验数据进行比较。我们的模型表明,单淘汰赛是有效的,但不公平的:游戏的数量是成正比的球队N的数量,但最弱的球队获胜的概率只衰减代数与N。相比之下,在联赛中,每支球队都与其他球队比赛,这是公平的,但效率低下:排名前$\sqrt{N}$的球队仍然在争夺冠军,而最弱的球队成为冠军的概率是指数级的小。我们还提出了一个逐步淘汰的时间表,包括初赛和冠军赛。最初,球队进行少量的预赛,随后,少数球队有资格进入冠军赛。该算法是公平和有效的:最好的球队获胜的概率很高,比赛的数量与$N^{9/5}$成比例,而传统的联赛需要N^3场比赛才能公平地确定冠军。

英文摘要:

We study the effects of randomness on competitions based on an elementary random process in which there is a finite probability that a weaker team upsets a stronger team. We apply this model to sports leagues and sports tournaments, and compare the theoretical results with empirical data. Our model shows that single-elimination tournaments are efficient but unfair: the number of games is proportional to the number of teams N, but the probability that the weakest team wins decays only algebraically with N. In contrast, leagues, where every team plays every other team, are fair but inefficient: the top $\sqrt{N}$ of teams remain in contention for the championship, while the probability that the weakest team becomes champion is exponentially small. We also propose a gradual elimination schedule that consists of a preliminary round and a championship round. Initially, teams play a small number of preliminary games, and subsequently, a few teams qualify for the championship round. This algorithm is fair and efficient: the best team wins with a high probability and the number of games scales as $N^{9/5}$, whereas traditional leagues require N^3 games to fairly determine a champion.

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

↑