Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Article

1 results

2020
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
Etessami, K., Stewart, A. & Yannakakis, M., 28 Feb 2020, In: Mathematics of Operations Research. 45, 1, p. 34-62 57 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File