The Secretary Problem and its Extensions: A Review
暂无分享,去创建一个
[1] Jorge Nuno Silva,et al. Mathematical Games , 1959, Nature.
[2] Minoru Sakaguchi,et al. Dynamic programming of some sequential sampling design , 1961 .
[3] David Lindley,et al. Dynamic Programming and Decision Theory , 1961 .
[4] Problems for Solutions: 5082-5091 , 1963 .
[5] S. M. Samuels,et al. Optimal selection based on relative rank (the “secretary problem”) , 1964 .
[6] S. M. Gusein-Zade,et al. The Problem of Choice and the Sptimal Stopping Rule for a Sequence of Independent Trials , 1966 .
[7] F. Mosteller,et al. Recognizing the Maximum of a Sequence , 1966 .
[8] Morris H. DeGroot,et al. Some Problems of Optimal Stopping , 1968 .
[9] Ernest G. Enns. The optimum strategy for choosing the maximum ofN independent random variables , 1970, Unternehmensforschung.
[10] A. Mucci,et al. Differential Equations and Optimal Choice Problems , 1973 .
[11] Isaac M. Sonin,et al. The Best Choice Problem for a Random Number of Objects , 1973 .
[12] A. Mucci,et al. On a Class of Secretary Problems , 1973 .
[13] G. Simons. Great Expectations: Theory of Optimal Stopping , 1973 .
[14] Expectations and variances of stopping variables in sequential selection processes , 1973 .
[15] Z. Govindarajulu,et al. The Secretary Problem with Interview Cost , 1974 .
[16] Mark C. K. Yang. Recognizing the maximum of a random sequence based on relative rank with backward solicitation , 1974 .
[17] On certain combinatorial identities , 1974 .
[18] T. Rasmussen. THE CANDIDATE PROBLEM WITH UNKNOWN POPULATION SIZE , 1975 .
[19] M. H. Smith,et al. A secretary problem with uncertain employment , 1975, Journal of Applied Probability.
[20] M. H. Smith,et al. A Secretary Problem with Finite Memory , 1975 .
[21] The secretary problem: optimal selection with interview cost from two groups of candidates , 1975 .
[22] W. T. Rasmussen,et al. Choosing the maximum from a sequence with a discount function , 1975 .
[23] Stephen M. Samuels,et al. The Infinite Secretary Problem , 1976 .
[24] S. M. Samuels,et al. The Finite-Memory Secretary Problem , 1977 .
[25] The Infinite Secretary Problem as the Limit of the Finite Problem , 1977 .
[26] M. L. Nikolaev. On a Generalization of the Best Choice Problem , 1977 .
[27] Joseph David Petruccelli. SOME BEST CHOICE PROBLEMS WITH PARTIAL INFORMATION. , 1978 .
[28] T. Stewart. Optimal Selection from a Random Sequence with Learning of the Underlying Distribution , 1978 .
[29] E. L. Aparo. On a problem of L. Moser , 1978 .
[30] Beniamin Goldys. THE SECRETARY PROBLEMTHE CASE WITH MEMORY FOR ONE STEP , 1978 .
[31] Anne B. Koehler,et al. Ax optimal policy for sampling from uncertain distributions , 1978 .
[32] Mitsushi Tamaki. Recognizing both the maximum and the second maximum of a sequence , 1979 .
[33] Jacqueline Gianini-Pettitt. Optimal selection based on relative ranks with a random number of individuals , 1979, Advances in Applied Probability.
[34] Mitsushi Tamaki. A SECRETARY PROBLEM WITH DOUBLE CHOICES , 1979 .
[35] J. Zabczyk,et al. An Optimal Selection Problem Associated with the Poisson Process , 1979 .
[36] Stephen M. Samuels,et al. On an optimal stopping problem of Gusein-Zade , 1980 .
[37] Albrecht Irle,et al. On the best choice problem with random population size , 1980, Z. Oper. Research.
[38] Optimal Stopping in an Urn , 1980 .
[39] T. J. Stewart,et al. The Secretary Problem with an Unknown Number of Options , 1981, Oper. Res..
[40] Joseph D. Petruccelli. Best-choice problems involving uncertainty of selection and recall of observations , 1981 .
[41] Thomas J. Lorenzen. Optimal Stopping with Sampling Cost: The Secretary Problem , 1981 .
[42] J. A. Bather,et al. The secretary problem with an unknown number of candidates , 1982 .
[43] Joseph D. Petruccelli. Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation , 1982, Advances in Applied Probability.
[44] Gregory Campbell. The maximum of a sequence with prior information , 1982 .