Order statistics and the length of the best-\(n\)-of-\((2n - 1)\) competition (Q2980071)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Order statistics and the length of the best-n-of-(2n - 1) competition |
scientific article; zbMATH DE number 6708629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Order statistics and the length of the best-\(n\)-of-\((2n - 1)\) competition |
scientific article; zbMATH DE number 6708629 |
Statements
Order statistics and the length of the best-<font><i>n</i></font>-of-(<font>2<i>n</i> − 1</font>) competition (English)
0 references
27 April 2017
0 references
best \(n\)-of-\((2n - 1)\) competition
0 references
expected length and variance of the length of the series
0 references
order statistic
0 references
paired comparison
0 references
sooner waiting time problem
0 references
0.8057195544242859
0 references
0.7349900007247925
0 references
0.7191162109375
0 references
0.6896419525146484
0 references
