Solving Markov decision processes by d-graph algorithms

zbMATH Open1318.93104MaRDI QIDQ5500937FDOQ5500937

Authors: Zoltán Kátai 

Publication date: 10 August 2015

Recommendations

• scientific article; zbMATH DE number 3961379
• scientific article; zbMATH DE number 4154239
• On some algorithms for limiting average Markov decision processes
• Markov decision processes
• scientific article; zbMATH DE number 549928

zbMATH Keywords

dynamic programminggraph algorithmsgraph representationMarkov decision processesoptimization problems

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Optimal stochastic control (93E20) Applications of graph theory to circuits and networks (94C15)

Cited In (6)

• Solving Markovian decision processes by successive elimination of variables
• Branching constraint satisfaction problems and Markov decision problems compared
• A framework and a mean-field algorithm for the local control of spatial processes
• Markov solution processes: modeling human problem solving with procedural knowledge space theory
• DP-solver: automating dynamic programming
• Finding the \(K\) best policies in a finite-horizon Markov decision process

This page was built for publication: Solving Markov decision processes by \(d\)-graph algorithms

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