The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (Q2884291): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.1110.0516 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.1110.0516 / rank | |||
Normal rank | |||
Latest revision as of 04:12, 20 December 2024
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
