A secretary problem with many lives. (English) Zbl 1398.60064
Summary: We consider a secretary type problem where an administrator who has only one on-line choice in \(m\) consecutive searches has to choose the best candidate in one of them.
MSC:
| 60G40 | Stopping times; optimal stopping problems; gambling theory |
References:
| [1] | Chow Y. S., Great Expectations: The Theory of Optimal Stopping (1971) · Zbl 0233.60044 |
| [2] | DOI: 10.1214/ss/1177012493 · doi:10.1214/ss/1177012493 |
| [3] | DOI: 10.1214/ECP.v15-1579 · Zbl 1225.60019 · doi:10.1214/ECP.v15-1579 |
| [4] | Gnedin A. V., Automat. Remote Control 42 pp 981– (1981) |
| [5] | DOI: 10.2307/2985407 · Zbl 0114.34904 · doi:10.2307/2985407 |
| [6] | DOI: 10.1016/S0012-365X(97)00091-5 · Zbl 0958.60041 · doi:10.1016/S0012-365X(97)00091-5 |
| [7] | DOI: 10.2307/3212880 · Zbl 0313.60033 · doi:10.2307/3212880 |
| [8] | Stadje , W. ( 1980 ). Efficient stopping of a random series of partially ordered points.Proc. III Int. Conf. Multiple Criteria Decis. Mak.Königswinter, 1979, Springer Lecture Notes in Economics and Mathematical Systems 177 (1980) . · Zbl 0468.60046 |
| [9] | Tamaki M., Math. Jap. 24 pp 439– (1979) |
| [10] | DOI: 10.2307/3212694 · Zbl 0348.60064 · doi:10.2307/3212694 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
