On Polynomial Sized MDP Succinct Policies

Abstract

Policies of Markov Decision Processes (MDPs) determine the next action to execute from the current state and, possibly, the history (the past states). When the number of states is large, succinct representations are often used to compactly represent both the MDPs and the policies in a reduced amount of space. In this paper, some problems related to the size of succinctly represented policies are analyzed. Namely, it is shown that some MDPs have policies that can only be represented in space super-polynomial in the size of the MDP, unless the polynomial hierarchy collapses. This fact motivates the study of the problem of deciding whether a given MDP has a policy of a given size and reward. Since some algorithms for MDPs work by finding a succinct representation of the value function, the problem of deciding the existence of a succinct representation of a value function of a given size and reward is also considered.

References in corpus (4)

• Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
• On the Complexity of Solving Markov Decision Problems
• Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
• Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes