IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v25y1998i3p375-385.html
   My bibliography  Save this article

Non-parametric procedure for knockout tournaments

Author

Listed:
  • Christopher Todd Edwards

Abstract

In a seeded knockout tournament, where teams have some preassigned strength, do we have any assurances that the best team in fact has won? Is there some insight to be gained by considering which teams beat which other teams solely examining the seeds? We pose an answer to these questions by using the difference in the seeds of the two players as the basis for a test statistic. We offer several models for the underlying probability structure to examine the null distribution and power functions and determine these for small tournaments (less than five teams). One structure each for 8 teams and 16 teams is examined, and we conjecture an asymptotic normal distribution for the test statistic.

Suggested Citation

  • Christopher Todd Edwards, 1998. "Non-parametric procedure for knockout tournaments," Journal of Applied Statistics, Taylor & Francis Journals, vol. 25(3), pages 375-385.
    • Handle: RePEc:taf:japsta:v:25:y:1998:i:3:p:375-385
    DOI: 10.1080/02664769823106
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/02664769823106
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/02664769823106?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. Jeff Horen & Raymond Riezman, 1985. "Comparing Draws for Single Elimination Tournaments," Operations Research, INFORMS, vol. 33(2), pages 249-262, April.
    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. Edward H. Kaplan & Stanley J. Garstka, 2001. "March Madness and the Office Pool," Management Science, INFORMS, vol. 47(3), pages 369-382, March.

    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. 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.
    3. Netanel Nissim & Aner Sela, 2020. "The Third Place Game," Journal of Sports Economics, , vol. 21(1), pages 64-86, January.
    4. 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.
    5. Dmitry Ryvkin & Andreas Ortmann, 2008. "The Predictive Power of Three Prominent Tournament Formats," Management Science, INFORMS, vol. 54(3), pages 492-504, March.
    6. 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.
    7. 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.
    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. 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.
    11. Kai A. Konrad & Dan Kovenock, 2010. "Contests With Stochastic Abilities," Economic Inquiry, Western Economic Association International, vol. 48(1), pages 89-103, January.
    12. Kovenock, Dan & Konrad, Kai A., 2006. "Multi-Stage Contests with Stochastic Ability," CEPR Discussion Papers 5844, C.E.P.R. Discussion Papers.
    13. 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.
    14. 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.
    15. Sela, Aner, 2022. "Effort allocations in elimination tournaments," Economics Letters, Elsevier, vol. 211(C).
    16. Donald Martin, 1999. "Paired comparison models applied to the design of the Major League baseball play-offs," Journal of Applied Statistics, Taylor & Francis Journals, vol. 26(1), pages 69-80.
    17. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    18. 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.
    19. Sela, Aner, 2023. "Two-stage elimination games," Journal of Mathematical Economics, Elsevier, vol. 109(C).
    20. Jun Zhang, 2008. "Simultaneous Signaling In Elimination Contests," Working Paper 1184, Economics Department, Queen's University.

    More about this item

    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:taf:japsta:v:25:y:1998:i:3:p:375-385. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    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.