A Solution to the Game of Googol
Gnedin, Alexander V.
Ann. Probab., Tome 22 (1994) no. 4, p. 1588-1595 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
For any $n > 2$ we construct an exchangeable sequence of positive continuous random variables, $X_1, \ldots, X_n$, for which, among all stopping rules, $\tau$, based on the $X$'s, $\sup_\tau P\{X_{\tau} = X_1 \vee \cdots \vee X_n\}$ is achieved by a rule based only on the relative ranks of the $X$'s.
Publié le : 1994-07-14
Classification:  Googol,  best-choice problem,  secretary problem,  60G40 
@article{1176988613,
     author = {Gnedin, Alexander V.},
     title = {A Solution to the Game of Googol},
     journal = {Ann. Probab.},
     volume = {22},
     number = {4},
     year = {1994},
     pages = { 1588-1595},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176988613}
}

Gnedin, Alexander V. A Solution to the Game of Googol. Ann. Probab., Tome 22 (1994) no. 4, pp.  1588-1595. http://gdmltest.u-ga.fr/item/1176988613/