One way to interpret the classical secretary problem (CSP) is to consider it as a special case of the following problem. We observe n independent indicator variables I1,I2,…,In sequentially and we try to stop on the last variable being equal to 1. If Ik=1 it means that the kth observed...

Let I1, I2, . . . , In be a sequence of independent indicator functions de- fined on a probability space (Ω, A, P ). We say that index k is a success time if Ik = 1. The sequence I1, I2, . . . , In is observed sequentially. The objective of this article is to predict the l-th last success, if...