How to Design a Stable Serial Knockout Competition

Roel Lambers (), Rudi Pendavingh () and Frits Spieksma ()
Additional contact information
Roel Lambers: Faculteit Business en Economie, Amsterdam University of Applied Sciences, 1102 CV Amsterdam, Netherlands
Rudi Pendavingh: Mathematics & Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands
Frits Spieksma: Mathematics & Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands

Mathematics of Operations Research, 2025, vol. 50, issue 2, 1421-1432

Abstract: 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 (e.g., first round, second round … semifinal, final) of the knockout tournaments. Following a fairness principle of treating all players equal, we identify an attractive property of an SKCl 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 following 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 eight players, and we prove that the resulting SKC is unique up to permutations of the players. We further prove that stable SKCs exist for any numbers of players that are a power of two, and we provide stable schedules for competitions on 16 and 32 players.

Keywords: Primary: 13P25; Secondary: 05-11; darts; combinatorics; Galois field; optimization; fairness (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2022.0352 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:50:y:2025:i:2:p:1421-1432

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().