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
| 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 |
Statements
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (English)
0 references
24 May 2012
0 references
simplex method policy
0 references
iteration method
0 references
Markov decision problem
0 references
strongly polynomial time
0 references
