[
[1] Ananatharam, V., Varaiya, P., Warland, J., 1987.
Asymptotically Efficient Allocation Rules for
the Multiarmed Bandit Problem with Multiple
Plays – Part I: I.I.D. Rewards. IEEE Transaction
of Automatic Control, Vol. Ac–32, No. 11,
pp.968-976.
10.1109/TAC.1987.1104491]Search in Google Scholar
[[2] Duda, R., 2010. Lwow School of Mathematics.
Wroclaw: Wroclaw University Publishing
House.
]Search in Google Scholar
[[3] Ethier, S.N., 2010. The Doctrine of Chances:
Probabilistic Aspects of Gambling. Berlin –
Heidelberg: Springer Verlag.
10.1007/978-3-540-78783-9]Search in Google Scholar
[[4] Lai, T.L., Robbins, H., 1985. Asymptotically
Efficient Adaptive Allocation Rules. Advanced
in Applied Mathematics, Vol. 6, pp.4-22.
10.1016/0196-8858(85)90002-8]Search in Google Scholar
[[5] Mauldin, R.D., 1981. The Scottish Book. Mathematics
from the Scottish Café. Boston – Basel –
Stuttgart: Birkhausen.
]Search in Google Scholar
[[6] Mycielski, J., 1992. Games with Perfect Information.
In: R.J. Aumann, S. Hart (eds.). Handbook
of Game theory with Economic
Application, Vol. 1, North – Holland, Amsterdam,
pp.20-40.
]Search in Google Scholar
[[7] Pijanowski, L., 1972. Przewodnik gier (Game
Guide). Warszawa: Iskry.
]Search in Google Scholar