Bounds for the quality and the number of steps in Bellman's value iteration algorithm (Q1317533): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q803049
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ulrich D. Holzbaur / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time bound for Howard's policy improvement algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fixed Points of the Optimal Reward Operator in Stochastic Dynamic Programming with Discount Factor Greater than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and good policies in stationary finite–stage Markovian decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abschätzungen für Spektralwerte / rank
 
Normal rank
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
    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 references

    Identifiers