Complexity of optimal small policies

Mathematics of Operations Research

Volumn 25, Issue 1, 2000, Pages 118-129

  Mundhenk, Martin ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

OPTIMAL SMALL POLICY; PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES (POMDP);

MARKOV PROCESSES;

EID: 0034138406     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.1.118.15214     Document Type: Article

References (10)

1. Gill, J. 1977. Computational complexity of probabilistic Turing machines. SIAM J. Compu. 6(6) 675-695.
2. Ladner, R. 1989. Polynomial space counting problems. SIAM J. Comput. 18 1087-1097.
3. Littman, M., J. Goldsmith, M. Mundhenk. 1998. The computational complexity of probabilistic planning. J. Artificial Intelligence Res. 9 1-36.
4. Lovejoy, W. 1991. A survey of algorithmic methods for partially observed Markov decision processes. Ann. Oper. Res. 28 47-66.
5. Mundhenk, M., J. Goldsmith, E. Allender. 1997. The complexity of the policy existence problem for partially-observable finite-horizon Markov decision processes. Proc. 25th Mathematical Foundations of Computer Sciences. Lecture Notes in Computer Science #1295, Springer-Verlag, 129-138.
6. Papadimitriou, C. 1994. Computational Complexity. Addison-Wesley, Reading, MA.
7. _, J. Tsitsiklis. 1987. The complexity of Markov decision processes. Math. Oper. Res. 12(3) 441-450.
8. Puterman, M. 1994. Markov Decision Processes. John Wiley & Sons, New York.
9. Smallwood, R., E. Sondik. 1973. The optimal control of partially observed Markov processes over the finite horizon. Oper. Res. 21 1071-1088.
10. Torán, J. 1991. Complexity classes defined by counting quantifiers. J. ACM 38(3) 753-774.