The Secretary Problem Site
The Secretary Problem Site
When is the right moment to choose?
Created by José Ángel Islas Anguiano, Ph.D.
Facultad de Ciencias Naturales y Exactas (FACINE), Universidad Autónoma de Sinaloa (UAS)
Imagine interviewing candidates one at a time. You cannot go back to someone you rejected. How can you maximize your chance of choosing the best?
The classical secretary problem gives a surprising answer: for a large number of candidates, observe roughly the first 37% without selecting anyone, then choose the next candidate who is better than everyone seen before.
Start here
1. Understand the 37% rule
Learn the simple hiring puzzle, see when the 37% rule applies, and discover why the mathematical answer works.
2. Try it yourself
Play a hiring game, choose when to stop, and compare your strategy with the exact optimal threshold.
3. Go deeper
Study the mathematical proof, investigate other models, and explore the research literature.
Read the backward-induction proof →
Explore variants & extensions →
About the subject
The secretary problem is a starting point for a family of optimal-stopping models. Different assumptions about the available information, number of choices, and objective lead to different mathematical questions.
Begin with the classical secretary problem, explore its exact optimal stopping rule, and experiment with interactive simulations. The site connects these ideas to variants and extensions and the research literature.