Extremal processes, secretary problems and the 1/ e law
Dietmar Pfeifer · Journal of Applied Probability · 1989
We consider a class of secretary problems in which the order of arrival of candidates is no longer uniformly distributed. By a suitable embedding in a time-transformed extremal process it is shown that the asymptotic winning probability is again 1/ e as in the classical situation. Extensions of the problem to more than one choice are also considered.