arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.02513math.CO
收藏

如何设计一个稳定的连环淘汰赛

How to Design a Stable Serial Knockout Competition

Frits Spieksma, Rudi Pendavingh, Roel Lambers

摘要:

我们研究了一种新的比赛形式,包括一系列的个人淘汰赛,我们称之为一系列淘汰赛(SKC)的新形式。这种格式最近被专业飞镖公司采用。根据每个淘汰赛所使用的球员的排名,球员可以在各个回合(例如第一轮,第二轮,...,半决赛,决赛)的淘汰赛。按照公平对待所有球员平等的原则,我们确定了一个有吸引力的SKC属性:每对球员应该在SKC的每一轮比赛中平等地相遇。如果这种性质确实存在,我们称由此产生的SKC是稳定的。在本说明中,我们正式这个概念,我们解决的问题:是否存在的每个淘汰赛赛,从而产生的SKC是稳定的?我们表明,使用连接到法诺飞机,答案是肯定的8名球员。我们展示了如何将其推广到任意数量的2的幂的玩家,并且我们为16和32个玩家的比赛提供了稳定的时间表

英文摘要:

We investigate a new tournament format that consists of a series of individual knockout tournaments; we call this new format a Serial Knockout Competition (SKC). This format has recently been adopted by the Professional Darts Corporation. Depending on the seedings of the players used for each of the knockout tournaments, players can meet in the various rounds (eg first round, second round, ..., semi-final, final) of the knockout tournaments. Following a fairness principle of treating all players equal, we identify an attractive property of an SKC: each pair of players should potentially meet equally often in each of the rounds of the SKC. If the seedings are such that this property is indeed present, we call the resulting SKC stable. In this note we formalize this notion, and we address the question: do there exist seedings for each of the knockout tournaments such that the resulting SKC is stable? We show, using a connection to the Fano plane, that the answer is yes for 8 players. We show how to generalize this to any number of players that is a power of 2, and we provide stable schedules for competitions on 16 and 32 players

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

↑