A discrete theory of search. II
Page 1
Igor Vajda (1971)
Aplikace matematiky
Yanhong Wu (1996)
Metrika
Jiří Michálek (1995)
Kybernetika
Chitgopekar, S.S. (1983)
International Journal of Mathematics and Mathematical Sciences
A. Janicki (1973)
Applicationes Mathematicae
Radim Jiroušek (1983)
Kybernetika
R. Różański (1982)
Applicationes Mathematicae
Jiří Cochlar, Ivan Vrana (1978)
Kybernetika
Belkadi, K., Gourgand, M., Benyettou, M. (2006)
Journal of Applied Mathematics and Decision Sciences
A. Hanen (1980)
Mathématiques et Sciences Humaines
M. Krzyśko (1984)
Applicationes Mathematicae
Jiří Cochlar (1980)
Kybernetika
Béla Bajnok, Svetoslav Semov (2014)
Discussiones Mathematicae Probability and Statistics
We revisit the problem of selecting an item from n choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first k items and then select the first subsequent item that ranks lower than the l-th lowest-ranked item among the first k. We prove that the optimal rule has k ~ n/e, as in the classical secretary problem where our sole objective is to select the item of lowest rank;...
В.К. Захаров, О.В. Сарманов, Б.А. Севастьянов (1969)
Matematiceskij sbornik
Page 1