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

DOI10.1080/03610926.2014.995822zbMATH Open1360.62240OpenAlexW2346143679MaRDI QIDQ2980071FDOQ2980071

Authors: Tamás Lengyel 

Publication date: 27 April 2017

Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2014.995822

Recommendations

• On the number of games played in a best of (2n – 1) series
• Bet(ch)a my team wins the playoffs
• scientific article; zbMATH DE number 4139477
• Gambler's ruin and winning a series by \(m\) games
• n-point, win-by-k games

zbMATH Keywords

order statisticpaired comparisonbest \(n\)-of-\((2n - 1)\) competitionexpected length and variance of the length of the seriessooner waiting time problem

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Order statistics; empirical distribution functions (62G30) Combinatorial probability (60C05) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• A First Course in Order Statistics
• Sooner and later waiting time problems for Markovian Bernoulli trials
• Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
• Title not available (Why is that?)
• n-point, win-by-k games
• On the asymptotic normality of the number of replications of a paired comparison
• Asymptotic probabilities in a sequential urn scheme related to the matchbox problem
• The Catalan Numbers Visit the World Series
• Wald's identity for the fair coin-tossing games and some applications

Cited In (4)

• Bet(ch)a my team wins the playoffs
• Title not available (Why is that?)
• Quasigeometric Distributions and Extra Inning Baseball Games
• On the number of games played in a best of (2n – 1) series

This page was built for publication: Order statistics and the length of the best-\(n\)-of-\((2n - 1)\) competition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980071)