Lower Bound On the Computational Complexity of Discounted Markov Decision Problems.
Yichen ChenMengdi WangPublished in: CoRR (2017)
Keyphrases
- markov decision problems
- lower bound
- optimal policy
- computational complexity
- infinite horizon
- markov decision processes
- np hard
- average cost
- upper bound
- linear programming
- decision problems
- partially observable
- dynamic programming
- state space
- reinforcement learning
- worst case
- policy iteration
- branch and bound algorithm
- optimal solution
- finite state
- long run
- objective function
- decision theoretic
- decision processes
- optimal control
- special case
- initial state
- expected utility
- utility function
- average reward
- transition probabilities
- multi agent
- queueing networks
- reinforcement learning algorithms
- sufficient conditions
- supervised learning
- finite number
- total cost
- multistage
- decision making
- search algorithm