A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices. (Q1426778)

From MaRDI portal
Revision as of 15:01, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices.
scientific article

    Statements

    A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices. (English)
    0 references
    15 March 2004
    0 references
    The author presents a new weakly monotonic backward induction algorithm working on bounded subsets of vector lattices. He proves some properties, gives examples and applications and illustrates the behavior of the algorithm. He describes a new way of handling weakly monotonic policies for nonstationary Markov decision processes in partially ordered spaces.
    0 references
    discrete-time controlled dynamic system
    0 references
    nonstationary Markov decision process
    0 references
    weakly monotonic optimal policy
    0 references
    partial order
    0 references
    vector lattices
    0 references
    handling
    0 references
    0 references

    Identifiers