如何挑选冠军
How to Choose a Champion
摘要:
联赛竞争的随机过程和缩放技术。在我们的模型中,一支弱队可以以固定的概率击败一支强队。各队进行相同数量的正面交锋,获胜次数最多的球队被宣布为冠军。最好的球队以高确定性赢得冠军所需的比赛总数T随着球队数量N的立方而增长,即,T ~ N^3。这一数字可以大大减少使用预赛,其中球队打了少量的比赛,随后,只有顶级球队进入下一轮。当有k轮比赛时,最好的球队成为冠军所需的总比赛次数T_k如下:T_k ~N^(γ_k),其中gamma_k=1/[1-(2/3)^(k+1)]。例如,对于k= 1,2,3,gamma_k=9/5,27/19,81/65。这些结果提出了一种算法,用于如何使用在N中是线性的时间表来推断最佳团队。我们的结论是,联赛的形式是一个无效的方法来确定最好的球队,从下向上的顺序淘汰是公平和有效的。
英文摘要:
League competition is investigated using random processes and scaling techniques. In our model, a weak team can upset a strong team with a fixed probability. Teams play an equal number of head-to-head matches and the team with the largest number of wins is declared to be the champion. The total number of games needed for the best team to win the championship with high certainty, T, grows as the cube of the number of teams, N, i.e., T ~ N^3. This number can be substantially reduced using preliminary rounds where teams play a small number of games and subsequently, only the top teams advance to the next round. When there are k rounds, the total number of games needed for the best team to emerge as champion, T_k, scales as follows, T_k ~N^(γ_k) with gamma_k=1/[1-(2/3)^(k+1)]. For example, gamma_k=9/5,27/19,81/65 for k=1,2,3. These results suggest an algorithm for how to infer the best team using a schedule that is linear in N. We conclude that league format is an ineffective method of determining the best team, and that sequential elimination from the bottom up is fair and efficient.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。