Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
| Year of publication: |
2020
|
|---|---|
| Authors: | Etessami, Kousha ; Stewart, Alistair ; Yannakakis, Mihalis |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 45.2020, 1, p. 34-62
|
| Subject: | multitype branching processes | Markov decision process | Bellman optimality equations | generalized Newton method | polynomial time algorithms | Theorie | Theory | Markov-Kette | Markov chain | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Entscheidung | Decision |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2018.0970 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012183018