Optimistic linear programming gives logarithmic regret for irreducible MDPs
Using Confidence Bounds for Exploitation-Exploration Trade-offs