3 citations · 3 across the 1 of their papers we have counts for
1 paper
Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri +1
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, dis…