Optimistic linear programming gives logarithmic regret for irreducible MDPs
r - max - a general polynomial time algorithm for near - optimal reinforcement learning .