Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
From MaRDI portal
Publication:1641009
DOI10.1016/j.ic.2018.02.013zbMath1394.60085arXiv1502.05533MaRDI QIDQ1641009
Kousha Etessami, Mihalis Yannakakis, Alistair Stewart
Publication date: 14 June 2018
Published in: Information and Computation, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.05533
greatest fixed point; Bellman optimality equations; branching Markov decision processes; Bellman optimality; probabilistic polynomial system
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)