Secretary Problem References
A curated bibliography supporting the mathematical explanations, historical timeline, and stopping-problem variants on this site.
References
The papers and books listed below support the mathematical explanations, historical timeline, and examples on The Secretary Problem Site.
This is a selective bibliography, not an exhaustive account of optimal stopping research. It includes foundational treatments of the classical and full-information secretary problems, multiple-choice and last-success extensions, historical surveys, and general references on optimal stopping.
The Timeline presents the historical setting of several of these papers. The Variants page describes the mathematical questions they address.
References
Bayón, L., P. Fortuny Ayuso, J. M. Grau, A. M. Oller-Marcén, and M. M. Ruiz. 2018. “The Best-or-Worst and the Postdoc Problems.” Journal of Combinatorial Optimization 35 (3). https://doi.org/10.1007/s10878-017-0203-4.
Bruss, F. Thomas. 1984. “A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options.” The Annals of Probability 12 (3). https://doi.org/10.1214/aop/1176993237.
———. 2000. “Sum the Odds to One and Stop.” The Annals of Probability 28 (3): 1384–91. https://doi.org/10.1214/aop/1019160340.
Chow, Y. S., S. Moriguti, H. Robbins, and S. M. Samuels. 1964. “Optimum Selection Based on Relative Rank (the Secretary Problem).” Israel Journal of Mathematics 2: 81–90. https://doi.org/10.1007/BF02759948.
Chow, Yuan Shih, Herbert Robbins, and David Siegmund. 1971. Great Expectations: The Theory of Optimal Stopping. Boston: Houghton Mifflin.
Ferguson, Thomas S. 1989. “Who Solved the Secretary Problem?” Statistical Science 4 (3): 282–89. https://doi.org/10.1214/ss/1177012493.
———. 2010. “Optimal Stopping and Applications.” https://www.math.ucla.edu/~tom/Stopping/Contents.html.
Freeman, P. R. 1983. “The Secretary Problem and Its Extensions: A Review.” International Statistical Review 51 (2): 189–206. https://doi.org/10.2307/1402748.
Gardner, Martin. 1960. “Mathematical Games: A Fifth Collection of Brain-Teasers.” Scientific American 202 (2). https://doi.org/10.1038/scientificamerican0260-150.
Gilbert, John P., and Frederick Mosteller. 1966. “Recognizing the Maximum of a Sequence.” Journal of the American Statistical Association 61 (313): 35–73. https://doi.org/10.1080/01621459.1966.10502008.
Glass, Darren. 2012. “The Secretary Problem from the Applicant’s Point of View.” The College Mathematics Journal 43 (1): 76–81. https://doi.org/10.4169/college.math.j.43.1.076.
Islas, José Ángel. 2026. “Convergence of the Critical Probabilities for Stopping Near the Top of a Random Walk.” https://arxiv.org/abs/2610.26670.
Kleinberg, Robert. 2005. “A Multiple-Choice Secretary Problem with Applications to Online Auctions.” In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 630–31. https://doi.org/10.1145/1070432.1070519.
Lindley, D. V. 1961. “Dynamic Programming and Decision Theory.” Journal of the Royal Statistical Society. Series C (Applied Statistics) 10 (1): 39–51. https://doi.org/10.2307/2985407.
Sakaguchi, Minoru. 1961. “Dynamic Programming of Some Sequential Sampling Design.” Journal of Mathematical Analysis and Applications 2 (3): 446–66. https://doi.org/10.1016/0022-247X(61)90023-3.
———. 1978. “Dowry Problems and OLA Policies.” Reports of Statistical Application Research, Japanese Union of Scientists and Engineers 25: 124–28.
Shiryaev, Albert N. 2007. Optimal Stopping Rules. Vol. 8. Stochastic Modelling and Applied Probability. Berlin; Heidelberg: Springer. https://doi.org/10.1007/978-3-540-74011-7.
Tamaki, Mitsushi. 1979a. “A Secretary Problem with Double Choices.” Journal of the Operations Research Society of Japan 22 (4): 257–65. https://doi.org/10.15807/jorsj.22.257.
———. 1979b. “Recognizing Both the Maximum and the Second Maximum of a Sequence.” Journal of Applied Probability 16 (4): 803–12. https://doi.org/10.2307/3213146.