Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q6827475)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6889862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes |
scientific article; zbMATH DE number 6889862 |
Statements
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (English)
0 references
14 June 2018
0 references
branching Markov decision processes
0 references
greatest fixed point
0 references
Bellman optimality equations
0 references
