Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009)
From MaRDI portal
(Redirected from Item:Q3449475)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes |
scientific article; zbMATH DE number 6504590
- Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
| 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; zbMATH DE number 6504590 |
|
Statements
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (English)
0 references
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (English)
0 references
14 June 2018
0 references
4 November 2015
0 references
branching Markov decision processes
0 references
greatest fixed point
0 references
Bellman optimality equations
0 references
probabilistic polynomial system
0 references
Bellman optimality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8752315
0 references
0.8687868
0 references
0.8571739
0 references
0.85617304
0 references
0 references
0.8549375
0 references
