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

From MaRDI portal
Revision as of 20:44, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
scientific article

    Statements

    Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    0 references
    branching Markov decision processes
    0 references
    greatest fixed point
    0 references
    Bellman optimality equations
    0 references
    0 references