Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput., 261(Part):355-382, 2018. [doi]

Authors

Kousha Etessami

This author has not been identified. Look up 'Kousha Etessami' in Google

Alistair Stewart

This author has not been identified. Look up 'Alistair Stewart' in Google

Mihalis Yannakakis

This author has not been identified. Look up 'Mihalis Yannakakis' in Google