Polynomial-Time Computation of Strong and <i>n</i>-Present-Value Optimal Policies in Markov Decision Chains (Q5359111)
From MaRDI portal
 | 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: Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains |
scientific article; zbMATH DE number 6778844
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Computation of Strong and <i>n</i>-Present-Value Optimal Policies in Markov Decision Chains |
scientific article; zbMATH DE number 6778844 |
Statements
Polynomial-Time Computation of Strong and <i>n</i>-Present-Value Optimal Policies in Markov Decision Chains (English)
0 references
22 September 2017
0 references
dynamic programming
0 references
computational complexity
0 references
infinite horizon
0 references
0.8940716
0 references
0.88199115
0 references
0 references
0 references
0.8807147
0 references
0.88037044
0 references
0.87588155
0 references
