1. Bellman, R. (1957) “Dynamic Programming”, Princeton University Press.
2. Berry D.A. and Fristedt, B. (1985), “Bandit Problems”, Chapman and Hall.
3. Dynkin, E.B. (1963) “The Optimum Choice of the instant of stopping a Markov process”, Soviet Math. Dokl. 4, 627–629.
4. Dynkin, E.B. and Yushkevich, A.A. (1969) “Markov Processes, Theorems and Problems”, Plenum Press.
5. Gittins J.C. (1979) “Bandit processes and dynamic allocation indices”, J. Roy. Statist. Soc. Ser. B 41, 148–177.