Finite-state approximations for denumerable state discounted Markov decision processes (Q1085078): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finite-state approximations to denumerable-state dynamic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming with Unbounded Rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive control of discounted Markov decision chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dynamic Programming with Unbounded Rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov programming by successive approximations with respect to weighted supremum norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state approximations for denumerable-state infinite-horizon discounted Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state approximations for denumerable state infinite horizon discounted Markov decision processes with unbounded rewards / rank
 
Normal rank

Latest revision as of 16:47, 17 June 2024

scientific article
Language Label Description Also known as
English
Finite-state approximations for denumerable state discounted Markov decision processes
scientific article

    Statements

    Finite-state approximations for denumerable state discounted Markov decision processes (English)
    0 references
    1986
    0 references
    The paper generalizes the finite-state interactive scheme of \textit{D. J. White} [in: Recent developments in Markov decision processes (1980; Zbl 0547.90064), and J. Math. Anal. Appl. 86, 292-306 (1982; Zbl 0533.90094)] to more general (denumerable) state sets and more general conditions of convergence. The rate of convergence is studied intensively and the asymptotic discount optimality of the policies generated by the algorithm is proved.
    0 references
    denumerable state discounted Markov decision processes
    0 references
    successive approximations
    0 references
    finite-state approximations
    0 references
    unbounded rewards
    0 references
    general conditions of convergence
    0 references
    rate of convergence
    0 references
    asymptotic discount optimality
    0 references

    Identifiers