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
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1502.05533 / rank | |||
Normal rank | |||
Revision as of 20:08, 18 April 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
