Bounds for the quality and the number of steps in Bellman's value iteration algorithm (Q1317533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 530094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for the quality and the number of steps in Bellman's value iteration algorithm |
scientific article; zbMATH DE number 530094 |
Statements
Bounds for the quality and the number of steps in Bellman's value iteration algorithm (English)
0 references
27 March 1995
0 references
discounted Markovian decision process
0 references
finite state space
0 references
infinite horizon
0 references
sub-optimal decisions
0 references
\(\varepsilon\)-optimal policy
0 references
0.8356183767318726
0 references
0.8334518074989319
0 references
0.8031609654426575
0 references
