Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations.
Kousha EtessamiAlistair StewartMihalis YannakakisPublished in: Math. Oper. Res. (2020)
Keyphrases
- markov decision processes
- min max
- policy iteration
- reachability analysis
- computational complexity
- factored mdps
- finite state
- state space
- optimal policy
- dynamic programming
- probabilistic model
- average cost
- interval estimation
- machine learning
- transition matrices
- markov decision process
- convergence rate
- model checking
- generative model
- markov chain