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
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Page moved from [mardi:Publication:3449475] to [mardi:Publication:1641009] |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:42, 2 May 2024
scientific article; zbMATH DE number 6504590
| 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
4 November 2015
0 references
branching Markov decision processes
0 references
probabilistic polynomial system
0 references
Bellman optimality
0 references
