Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q115038539, #quickstatements; #temporary_batch_1711094041063 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115038539 / rank | |||
Normal rank | |||
Revision as of 12:27, 22 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming |
scientific article |
Statements
Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (English)
0 references
28 September 2018
0 references
Markov decision process
0 references
modified policy iteration
0 references
strongly polynomial
0 references
policy
0 references
algorithm
0 references
