A new Secretary Problem is considered, where for fixed k and m one wins if at some time i = m(j .. 1) + 1 up to jm one selects one of the j best items among the first jm items, j = 1,...,k. Selection is based on relative ranks only. Interest lies in small k values, such as k = 2 or 3. This is...

A version of a secretary problem is considered: Let X_j, j = 1,...,n be i.i.d. random variables. Like in the classical secretary problem the optimal stopper only observes Y_j = 1, if X_j is a (relative) record, and Y_j = 0, otherwise. The actual X_j-values are not revealed. The goal is to maximize...