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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:32, 3 February 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
