Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards

Abstract

We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. The player receives a state-dependent reward each time it plays an arm. The number of states and the state transition probabilities of an arm are unknown to the player. The player's objective is to maximize its long-term total reward by learning the best arm over time. We show that under certain conditions on the state transition probabilities of the arms, a sample mean based index policy achieves logarithmic regret uniformly over the total number of trials. The result shows that sample mean based index policies can be applied to learning problems under the rested Markovian bandit model without loss of optimality in the order. Moreover, comparision between Anantharam's index policy and UCB shows that by choosing a small exploration parameter UCB can have a smaller regret than Anantharam's index policy.

The result of Corollary 1 does not hold in general. It is removed in the replacement

Cited by in corpus (5)

• Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems
• Learning in A Changing World: Restless Multi-Armed Bandit with Unknown Dynamics
• Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards
• Online Newton Step Algorithm with Estimated Gradient
• Performance and Convergence of Multi-user Online Learning