Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos. Regret Bounds for Restless Markov Bandits. In Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann, editors, Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings. Volume 7568 of Lecture Notes in Computer Science, pages 214-228, Springer, 2012. [doi]
@inproceedings{OrtnerRAM12,
title = {Regret Bounds for Restless Markov Bandits},
author = {Ronald Ortner and Daniil Ryabko and Peter Auer and Rémi Munos},
year = {2012},
doi = {10.1007/978-3-642-34106-9_19},
url = {http://dx.doi.org/10.1007/978-3-642-34106-9_19},
researchr = {https://researchr.org/publication/OrtnerRAM12},
cites = {0},
citedby = {0},
pages = {214-228},
booktitle = {Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings},
editor = {Nader H. Bshouty and Gilles Stoltz and Nicolas Vayatis and Thomas Zeugmann},
volume = {7568},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-34105-2},
}