# Lower Bound On the Computational Complexity of Discounted Markov Decision Problems

20 May 2017

We study the computational complexity of the infinite-horizon discounted-reward Markov Decision Problem (MDP) with a finite state space $|\mathcal{S}|$ and a finite action space $|\mathcal{A}|$. We show that any randomized algorithm needs a running time at least $\Omega(|\mathcal{S}|^2|\mathcal{A}|)$ to compute an $\epsilon$-optimal policy with high probability... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now