IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i2p1421-1432.html
   My bibliography  Save this article

How to Design a Stable Serial Knockout Competition

Author

Listed:
  • 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)

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.

Suggested Citation

  • Roel Lambers & Rudi Pendavingh & Frits Spieksma, 2025. "How to Design a Stable Serial Knockout Competition," Mathematics of Operations Research, INFORMS, vol. 50(2), pages 1421-1432, May.
  • Handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:1421-1432
    DOI: 10.1287/moor.2022.0352
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0352
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.0352?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:1421-1432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.