Bounds for the quality and the number of steps in Bellman's value iteration algorithm (Q1317533): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01719454 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088930631 / rank | |||
Normal rank | |||
Latest revision as of 11:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the quality and the number of steps in Bellman's value iteration algorithm |
scientific article |
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
