IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v46y2017i1p406-414.html
   My bibliography  Save this article

Order statistics and the length of the best-n-of-(2n − 1) competition

Author

Listed:
  • T. Lengyel

Abstract

The best-4-of-7 series is a popular playoff format to decide the champion in most North American professional sports. World Series (best-4-of-7) type competitions give rise to interesting probabilistic and statistical questions. We determine the expected length of this type of series by relating it to a problem involving order statistics. We also calculate the variance of the length and provide a simple formula for series of fair games. The method can be extended to derive higher order moments. This novel approach leads to new results that can be formulated in closed forms in terms of the distribution function of various binomial distributions. The emphasis is on establishing the connection to order statistics and obtaining closed forms. The relation to the negative binomial distribution as well as to the sooner waiting time problem in sequential testing is also discussed. We also consider the case when ties are allowed in the single games.

Suggested Citation

  • T. Lengyel, 2017. "Order statistics and the length of the best-n-of-(2n − 1) competition," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(1), pages 406-414, January.
    • Handle: RePEc:taf:lstaxx:v:46:y:2017:i:1:p:406-414
    DOI: 10.1080/03610926.2014.995822
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2014.995822
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2014.995822?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.

    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:lstaxx:v:46:y:2017:i:1:p:406-414. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.