On the complexity of partially observed Markov decision processes

DOI10.1016/0304-3975(95)00158-1zbMath0871.68081OpenAlexW1970088948MaRDI QIDQ1351500

Michel de Rougemont, Anatol Slissenko, Dmitri Burago

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00158-1

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Markov processes (60J99)

Related Items (3)

Optimal control of infinite horizon partially observable decision processes modelled as generators of probabilistic regular languages ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights ⋮ On the undecidability of probabilistic planning and related stochastic optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming and stochastic control
• Shortest paths without a map
• Games against nature
• The Complexity of Markov Decision Processes
• Finite Continuous Time Markov Chains
• The Complexity of Enumeration and Reliability Problems

This page was built for publication: On the complexity of partially observed Markov decision processes