Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
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 | Mathematische Optimierung | Mathematical programming | Markov-Kette | Markov chain | Entscheidung | Decision |
-
Lee, Ilbin, (2014)
-
Schlosser, Rainer, (2022)
-
A numerical study of Markov decision process algorithms for multi-component replacement problems
Andersen, Jesper Fink, (2022)
- More ...
-
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game
Etessami, Kousha, (2021)
-
The complexity of optimal multidimensional pricing for a unit-demand buyer
Chen, Xi, (2018)
-
Crump, Kenny S., (1998)
- More ...