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

DOI10.1080/03610926.2014.995822zbMath1360.62240OpenAlexW2346143679MaRDI QIDQ2980071

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

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

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

Cites Work

• Unnamed Item
• Sooner and later waiting time problems for Markovian Bernoulli trials
• Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
• The Catalan Numbers Visit the World Series
• Wald's Identity for the Fair Coin-Tossing Games and Some Applications
• On the asymptotic normality of the number of replications of a paired comparison
• n-point, win-by-k games
• Asymptotic probabilities in a sequential urn scheme related to the matchbox problem
• A First Course in Order Statistics

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