Order statistics and the length of the best-n-of-(2n - 1) competition
From MaRDI portal
Publication:2980071
Recommendations
Cites work
- scientific article; zbMATH DE number 44004 (Why is no real title available?)
- n-point, win-by-k games
- A First Course in Order Statistics
- Asymptotic probabilities in a sequential urn scheme related to the matchbox problem
- On the asymptotic normality of the number of replications of a paired comparison
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Sooner and later waiting time problems for Markovian Bernoulli trials
- The Catalan Numbers Visit the World Series
- Wald's identity for the fair coin-tossing games and some applications
Cited in
(4)
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)