The Finite-Memory Secretary Problem
Herman Rubin, Stephen M. Samuels · The Annals of Probability · 1977
The expected rank of the individual selected in the secretary problem can be kept bounded as the number of individuals becomes infinite even if we are not permitted to remember more than one individual at a time. The least upper bound of these expected ranks is derived: it is approximately 7.4.