Abstract
Real numbers from the interval [0,1] are randomly selected with uniform distribution. There are n of them and they measure shortcomings of the candidates from the pool of n secretaries in a search process; a smaller number indicates a better candidate. The numbers come one by one. We know only their relative ranks but do not know their values. We want to stop on the current element maximizing the probability that its value is smaller than 1n. We provide a complete solution of this model by constructing an optimal stopping algorithm, establishing its asymptotic performance, and showing how to calculate all characteristics of the algorithm with desired accuracy.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
