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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.1110.0516 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984901446 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:28, 19 March 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
