Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1502.05533 / rank | |||
Normal rank | |||
Revision as of 21: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
14 June 2018
0 references
branching Markov decision processes
0 references
greatest fixed point
0 references
Bellman optimality equations
0 references
