Learning When to Stop Searching

Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri, James R. Wright

Abstract: In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, distributions are no...