Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (Q3449475): Difference between revisions
From MaRDI portal
Item:Q3449475
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:58, 4 February 2024
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
4 November 2015
0 references
branching Markov decision processes
0 references
probabilistic polynomial system
0 references
Bellman optimality
0 references