Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256)
From MaRDI portal
scientific article; zbMATH DE number 7195313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations |
scientific article; zbMATH DE number 7195313 |
Statements
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (English)
0 references
30 April 2020
0 references
analysis of algorithms, programming
0 references
dynamic programming
0 references
Markov
0 references
multitype branching processes
0 references
Markov decision processes
0 references
Bellman optimality equations
0 references
generalized Newton method
0 references
polynomial time algorithms
0 references
0 references
0 references
0 references
