The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate (Q2884291)
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: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate |
scientific article; zbMATH DE number 6038605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate |
scientific article; zbMATH DE number 6038605 |
Statements
24 May 2012
0 references
simplex method policy
0 references
iteration method
0 references
Markov decision problem
0 references
strongly polynomial time
0 references
The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate (English)
0 references
