1. K. Ano, Bilateral secretary problem recognizing the maximum or the second maximum of a sequence, J. Information & Optimization Sciences, 11 (1990), pp. 177–188.
2. E. Dynkin and A. Yushkevich, Theorems and Problems on Markov Processes, Plenum, New York, 1969.
3. R. Eidukjavicjus, Optimalna osianovka markovskoj cepi dvumia momentami ostanovki, Lit. Mat. Sbornik, 19 (1979), pp. 181–183. Inf. XIX conf. math.
4. E. Enns and E. Ferenstein, On a multi-person time-sequential game with priorities, Sequential Analysis, 6 (1987), pp. 239–256.
5. J. Preater, A survey of secretary problems with multiple appointments, Research Report 88–12, Dept. of Math, Univ. of Keele, Keele, ST5 5BG, UK, 1988.