This article is cited in 2 scientific papers (total in 2 papers)
The problem of choice and the optimal stopping rule for a sequence of random trials
S. M. Gusein-Zade
Suppose we have to choose an element from a finite set $A$ which consist of $n$ elements. Let $A$ be ordered by quality. We regard our choice as successful if the selected element is one of the best $r$ elements of $A$. Let us enumerate the elements of $A$ in such order as we learn them. After learning at we know the comparative qualities of $a_1,a_2,…,a_t$ but we know nothing about the quality of the remaining $n-t$ elements of $A$. While learning $a_t$ we can either accept it (then the choice is made) or reject it (then it will be impossible to return to it). We describe the optimal policy which secures the greatest probability of the successful choice and describe its asymptotical behaviour as $n\to\infty$.
PDF file (296 kB)
Theory of Probability and its Applications, 1966, 11:3, 472–476
S. M. Gusein-Zade, “The problem of choice and the optimal stopping rule for a sequence of random trials”, Teor. Veroyatnost. i Primenen., 11:3 (1966), 534–537; Theory Probab. Appl., 11:3 (1966), 472–476
Citation in format AMSBIB
\paper The problem of choice and the optimal stopping rule for a~sequence of random trials
\jour Teor. Veroyatnost. i Primenen.
\jour Theory Probab. Appl.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
Sergei I. Dotsenko, Anna A. Ivashko, “O modelyakh nailuchshego dvustoronnego dvukhetapnogo vzaimnogo vybora”, MTIP, 9:1 (2017), 45–61
Sergei I. Dotsenko, Georgii M. Shevchenko, “Zadacha nailuchshego vybora s ischezayuschimi ob'ektami”, MTIP, 12:2 (2020), 63–81
|Number of views:|