The complexity of optimal small policies
From MaRDI portal
complexityoptimal small policy computationpartially-observable Markov decision processesplanning problems
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- The Complexity of Markov Decision Processes
- On the complexity of partially observed Markov decision processes
- A Corrected And Improved Computational Scheme For Finite Horizon Partially Observable Markov Decision Processes
- Complexity of finite-horizon Markov decision process problems
- Nonapproximability results for partially observable Markov decision processes
Cited in
(8)- On the complexity of partially observed Markov decision processes
- Nonapproximability results for partially observable Markov decision processes
- Complexity of finite-horizon Markov decision process problems
- On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results
- On the complexity of finite memory policies for Markov decision processes
- The Complexity of Markov Decision Processes
- scientific article; zbMATH DE number 1361472 (Why is no real title available?)
- scientific article; zbMATH DE number 2243354 (Why is no real title available?)
This page was built for publication: The complexity of optimal small policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757626)
