Regret Bounds for Restless Markov Bandits

Abstract

We consider the restless Markov bandit problem, in which the state of each arm evolves according to a Markov process independently of the learner's actions. We suggest an algorithm that after $T$ steps achieves $\tilde{O}(\sqrt{T})$ regret with respect to the best policy that knows the distributions of all arms. No assumptions on the Markov chains are made except that they are irreducible. In addition, we show that index-based policies are necessarily suboptimal for the considered problem.

In proceedings of The 23rd International Conference on Algorithmic Learning Theory (ALT 2012)

Cited by in corpus (1)

• Online Regret Bounds for Undiscounted Continuous Reinforcement Learning