Computational complexity in Markov decision theory

MaRDI QIDQ3084852zbMATH OpenFDO

Authors John N. Tsitsiklis

Publication date 25 March 2011

zbMATH Keywords

computational complexityMarkov decision problemsMDPssequential decision making

Mathematics Subject Classification ID

General considerations in statistical decision theory (62C05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Complexity of finite-horizon Markov decision process problems
• scientific article; zbMATH DE number 4154239
• The Complexity of Markov Decision Processes
• A methodology for computation reduction for specially structured large scale Markov decision problems
• scientific article; zbMATH DE number 700091

Cited in

(5)

• A methodology for computation reduction for specially structured large scale Markov decision problems
• A note on optimization formulations of Markov decision processes
• Complexity of finite-horizon Markov decision process problems
• The Complexity of Markov Decision Processes
• scientific article; zbMATH DE number 5658801 (Why is no real title available?)

This page was built for publication: Computational complexity in Markov decision theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084852)