IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v65y2017i6p1589-1596.html
   My bibliography  Save this article

Random Knockout Tournaments

Author

Listed:
  • Ilan Adler

    (Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, California 94720)

  • Yang Cao

    (Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90033)

  • Richard Karp

    (Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley, California 94720)

  • Erol A. Peköz

    (Questrom School of Business, Boston University, Boston, Massachusetts 02215)

  • Sheldon M. Ross

    (Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90033)

Abstract

We consider a random knockout tournament among players 1,…, n , in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random. Supposing that there are numbers v 1 ,…, v n such that a match between i and j will be won by i with probability v i /( v i + v j ), we obtain a lower bound on the tournament win probability for the best player, as well as upper and lower bounds for all of the players. We also obtain additional bounds by considering the best and worst formats for player 1 in the special case v 1 > v 2 = v 3 = … = v n .

Suggested Citation

  • Ilan Adler & Yang Cao & Richard Karp & Erol A. Peköz & Sheldon M. Ross, 2017. "Random Knockout Tournaments," Operations Research, INFORMS, vol. 65(6), pages 1589-1596, December.
    • Handle: RePEc:inm:oropre:v:65:y:2017:i:6:p:1589-1596
    DOI: 10.1287/opre.2017.1657
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2017.1657
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2017.1657?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. Khatibi, Arash & King, Douglas M. & Jacobson, Sheldon H., 2015. "Modeling the winning seed distribution of the NCAA Division I men׳s basketball tournament," Omega, Elsevier, vol. 50(C), pages 141-148.
    2. Jeff Horen & Raymond Riezman, 1985. "Comparing Draws for Single Elimination Tournaments," Operations Research, INFORMS, vol. 33(2), pages 249-262, April.
    3. Sheldon H. Jacobson & Douglas M. King, 2009. "Seeding in the NCAA Men's Basketball Tournament: When is a Higher Seed Better?," Journal of Gambling Business and Economics, University of Buckingham Press, vol. 3(2), pages 63-87, September.
    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. 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.

    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. Ira Horowitz, 2018. "Competitive Balance in the NBA Playoffs," The American Economist, Sage Publications, vol. 63(2), pages 215-227, October.
    2. Karpov, Alexander, 2015. "A theory of knockout tournament seedings," Working Papers 0600, University of Heidelberg, Department of Economics.
    3. 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.
    4. Sela, Aner, 2022. "Effort allocations in elimination tournaments," Economics Letters, Elsevier, vol. 211(C).
    5. 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.
    6. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    7. 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.
    8. Netanel Nissim & Aner Sela, 2020. "The Third Place Game," Journal of Sports Economics, , vol. 21(1), pages 64-86, January.
    9. Sela, Aner, 2023. "Two-stage elimination games," Journal of Mathematical Economics, Elsevier, vol. 109(C).
    10. 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.
    11. Dmitry Ryvkin & Andreas Ortmann, 2008. "The Predictive Power of Three Prominent Tournament Formats," Management Science, INFORMS, vol. 54(3), pages 492-504, March.
    12. Dagaev Dmitry & Rudyak Vladimir Yu., 2019. "Seeding the UEFA Champions League participants: evaluation of the reforms," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 15(2), pages 129-140, June.
    13. Jun Zhang, 2008. "Simultaneous Signaling In Elimination Contests," Working Paper 1184, Economics Department, Queen's University.
    14. Arlegi, Ritxar & Dimitrov, Dinko, 2020. "Fair elimination-type competitions," European Journal of Operational Research, Elsevier, vol. 287(2), pages 528-535.
    15. Ryvkin, Dmitry, 2010. "The selection efficiency of tournaments," European Journal of Operational Research, Elsevier, vol. 206(3), pages 667-675, November.
    16. Chen Cohen & Ishay Rabi & Aner Sela, 2023. "Optimal seedings in interdependent contests," Annals of Operations Research, Springer, vol. 328(2), pages 1263-1285, September.
    17. 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.
    18. 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.
    19. Edward H. Kaplan & Stanley J. Garstka, 2001. "March Madness and the Office Pool," Management Science, INFORMS, vol. 47(3), pages 369-382, March.
    20. Dmitry Ryvkin, 2009. "Tournaments of Weakly Heterogeneous Players," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 11(5), pages 819-855, October.

    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:oropre:v:65:y:2017:i:6:p:1589-1596. 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.