IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i1d10.1007_s10878-017-0164-7.html
   My bibliography  Save this article

Competitive intensity and quality maximizing seedings in knock-out tournaments

Author

Listed:
  • Dmitry Dagaev

    (National Research University Higher School of Economics)

  • Alex Suzdaltsev

    (Stanford Graduate School of Business)

Abstract

Before a knock-out tournament starts, the participants are assigned to positions in the tournament bracket through a process known as seeding. There are many ways to seed a tournament. In this paper, we solve a discrete optimization problem of finding a seeding that maximizes spectator interest in a tournament when spectators are interested in matches with high competitive intensity (i.e., matches that involve teams comparable in strength) and high quality (i.e., matches that involve strong teams). We find a solution to the problem under two assumptions: the objective function is linear in quality and competitive intensity and a stronger team beats a weaker one with sufficiently high probability. Depending on parameters, only two special classes of seedings can be optimal. While one of the classes includes a seeding that is often used in practice, the seedings in the other class are very different. When we relax the assumption of linearity, we find that these classes of seedings are in fact optimal in a sizable number of cases. In contrast to existing literature on optimal seedings, our results are valid for an arbitrarily large number of participants in a tournament.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-017-0164-7
    DOI: 10.1007/s10878-017-0164-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0164-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0164-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Baumann Robert & Matheson Victor A. & Howe Cara A., 2010. "Anomalies in Tournament Design: The Madness of March Madness," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 6(2), pages 1-11, April.
    2. Jeffrey Ely & Alexander Frankel & Emir Kamenica, 2015. "Suspense and Surprise," Journal of Political Economy, University of Chicago Press, vol. 123(1), pages 215-260.
    3. Jeff Horen & Raymond Riezman, 1985. "Comparing Draws for Single Elimination Tournaments," Operations Research, INFORMS, vol. 33(2), pages 249-262, April.
    4. Rosen, Sherwin, 1986. "Prizes and Incentives in Elimination Tournaments," American Economic Review, American Economic Association, vol. 76(4), pages 701-715, September.
    5. Wright, Mike, 2014. "OR analysis of sporting rules – A survey," European Journal of Operational Research, Elsevier, vol. 232(1), pages 1-8.
    6. Frederic Palomino and Luca Rigotti., 2000. "The Sport League's Dilemma: Competitive Balance versus Incentives to Win," Economics Working Papers E00-292, University of California at Berkeley.
    7. 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.
    8. Dmitry Ryvkin, 2005. "The Predictive Power of Noisy Elimination Tournaments," CERGE-EI Working Papers wp252, The Center for Economic Research and Graduate Education - Economics Institute, Prague.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    2. László Csató, 2020. "Optimal Tournament Design: Lessons From the Men’s Handball Champions League," Journal of Sports Economics, , vol. 21(8), pages 848-868, December.
    3. Arlegi, Ritxar & Dimitrov, Dinko, 2020. "Fair elimination-type competitions," European Journal of Operational Research, Elsevier, vol. 287(2), pages 528-535.
    4. Ilya V. Solntsev, Andrey A. Kurov, 2024. "Sports Tournament Design as a Source of Economic Impact (Through the Example of Russian Premier League)," Journal of Applied Economic Research, Graduate School of Economics and Management, Ural Federal University, vol. 23(2), pages 304-340.
    5. Lunander Anders & Karlsson Niklas, 2023. "Choosing opponents in skiing sprint elimination tournaments," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 19(3), pages 205-221, September.
    6. 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.
    7. Chen Cohen & Ishay Rabi & Aner Sela, 2023. "Optimal seedings in interdependent contests," Annals of Operations Research, Springer, vol. 328(2), pages 1263-1285, September.
    8. Federico Della Croce & Gabriele Dragotto & Rosario Scatamacchia, 2022. "On fairness and diversification in WTA and ATP tennis tournaments generation," Annals of Operations Research, Springer, vol. 316(2), pages 1107-1119, September.
    9. Karlsson, Niklas & Lunander, Anders, 2020. "Choosing Opponents in Skiing Sprint Elimination Tournaments," Working Papers 2020:6, Örebro University, School of Business, revised 01 Sep 2020.

    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. Arlegi, Ritxar & Dimitrov, Dinko, 2020. "Fair elimination-type competitions," European Journal of Operational Research, Elsevier, vol. 287(2), pages 528-535.
    2. 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.
    3. Karpov, Alexander, 2015. "A theory of knockout tournament seedings," Working Papers 0600, University of Heidelberg, Department of Economics.
    4. Dmitry Dagaev & Alex Suzdaltsev, 2015. "Seeding, Competitive Intensity and Quality in Knock-Out Tournaments," HSE Working papers WP BRP 91/EC/2015, National Research University Higher School of Economics.
    5. 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.
    6. Sela, Aner, 2022. "Effort allocations in elimination tournaments," Economics Letters, Elsevier, vol. 211(C).
    7. Netanel Nissim & Aner Sela, 2020. "The Third Place Game," Journal of Sports Economics, , vol. 21(1), pages 64-86, January.
    8. Jun Zhang, 2008. "Simultaneous Signaling In Elimination Contests," Working Paper 1184, Economics Department, Queen's University.
    9. Chen Cohen & Ishay Rabi & Aner Sela, 2023. "Optimal seedings in interdependent contests," Annals of Operations Research, Springer, vol. 328(2), pages 1263-1285, September.
    10. Kovenock, Dan & Konrad, Kai A., 2006. "Multi-Stage Contests with Stochastic Ability," CEPR Discussion Papers 5844, C.E.P.R. Discussion Papers.
    11. Segev, Ella & Sela, Aner, 2014. "Multi-stage sequential all-pay auctions," European Economic Review, Elsevier, vol. 70(C), pages 371-382.
    12. 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.
    13. 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.
    14. 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.
    15. Stracke, Rudi & Sunde, Uwe, 2014. "Dynamic Incentive Effects of Heterogeneity in Multi-Stage Promotion Contests," IZA Discussion Papers 8368, Institute of Labor Economics (IZA).
    16. Kräkel, Matthias, 2004. "Emotions and Incentives," IZA Discussion Papers 1270, Institute of Labor Economics (IZA).
    17. 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.
    18. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    19. Jun Zhang & Ruqu Wang, 2009. "The Role of Information Revelation in Elimination Contests," Economic Journal, Royal Economic Society, vol. 119(536), pages 613-641, March.
    20. Alex Krumer & Reut Megidish & Aner Sela, 2017. "First-mover advantage in round-robin tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 633-658, March.

    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:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-017-0164-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.