IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i2p1421-1432.html

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
    ---><---

    References listed on IDEAS

    as
    1. Christian Groh & Benny Moldovanu & Aner Sela & Uwe Sunde, 2012. "Optimal seedings in elimination tournaments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 49(1), pages 59-80, January.
    2. Jeff Horen & Raymond Riezman, 1985. "Comparing Draws for Single Elimination Tournaments," Operations Research, INFORMS, vol. 33(2), pages 249-262, April.
    3. John Considine & Liam Gallagher, 2018. "Competitive balance in a quasi-double knockout tournament," Applied Economics, Taylor & Francis Journals, vol. 50(18), pages 2048-2055, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Csató, László, 2023. "How to avoid uncompetitive games? The importance of tie-breaking rules," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1260-1269.
    2. Sela, Aner, 2022. "Effort allocations in elimination tournaments," Economics Letters, Elsevier, vol. 211(C).
    3. Netanel Nissim & Aner Sela, 2020. "The Third Place Game," Journal of Sports Economics, , vol. 21(1), pages 64-86, January.
    4. Sela, Aner, 2023. "Two-stage elimination games," Journal of Mathematical Economics, Elsevier, vol. 109(C).
    5. Hall Nicholas G. & Liu Zhixin, 2024. "Opponent choice in tournaments: winning and shirking," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 20(2), pages 67-86, June.
    6. Jun Zhang, 2008. "Simultaneous Signaling In Elimination Contests," Working Paper 1184, Economics Department, Queen's University.
    7. Arlegi, Ritxar & Dimitrov, Dinko, 2020. "Fair elimination-type competitions," European Journal of Operational Research, Elsevier, vol. 287(2), pages 528-535.
    8. Chen Cohen & Ishay Rabi & Aner Sela, 2023. "Optimal seedings in interdependent contests," Annals of Operations Research, Springer, vol. 328(2), pages 1263-1285, September.
    9. Dmitry Dagaev & Alex Suzdaltsev, 2018. "Competitive intensity and quality maximizing seedings in knock-out tournaments," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 170-188, January.
    10. Zhang, Jun, 2008. "Simultaneous Signaling in Elimination Contests," Queen's Economics Department Working Papers 273661, Queen's University - Department of Economics.
    11. Aner Sela, 2023. "Elimination Games," Working Papers 2312, Ben-Gurion University of the Negev, Department of Economics.
    12. Ritxar Arlegi & Institute for Advanced Research in Business and Economics (INARBE) & Dinko Dimitrov, 2018. "Fair Competition Design," Documentos de Trabajo - Lan Gaiak Departamento de Economía - Universidad Pública de Navarra 1803, Departamento de Economía - Universidad Pública de Navarra.
    13. Kovenock, Dan & Konrad, Kai A., 2006. "Multi-Stage Contests with Stochastic Ability," CEPR Discussion Papers 5844, Centre for Economic Policy Research.
    14. Karpov, Alexander, 2015. "A theory of knockout tournament seedings," Working Papers 0600, University of Heidelberg, Department of Economics.
    15. Catepillán, Jorge & Figueroa, Nicolás & Lemus, Jorge, 2025. "Signaling in dynamic contests with heterogeneous rivals," Journal of Mathematical Economics, Elsevier, vol. 116(C).
    16. Matthias Kräkel, 2014. "Optimal seedings in elimination tournaments revisited," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 77-91, April.
    17. J. Amegashie & Marco Runkel, 2007. "Sabotaging Potential Rivals," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(1), pages 143-162, January.
    18. Alex Krumer & Reut Megidish & Aner Sela, 2017. "Round‐Robin Tournaments with a Dominant Player," Scandinavian Journal of Economics, Wiley Blackwell, vol. 119(4), pages 1167-1200, October.
    19. Oliver Gürtler & Markus Lang & Tim Pawlowski, 2015. "On the Release of Players to National Teams," Journal of Sports Economics, , vol. 16(7), pages 695-713, October.
    20. Bo Chen & Shanlin Jin, 2023. "Elimination contests with collusive team players," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 25(1), pages 61-89, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.