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

Fingerprint

Dive into the research topics of 'Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations'. Together they form a unique fingerprint.

Earth and Planetary Sciences

Mathematics

Computer Science