The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (Q2884291)

From MaRDI portal
Revision as of 15:28, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
scientific article

    Statements

    The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate (English)
    0 references
    0 references
    24 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simplex method policy
    0 references
    iteration method
    0 references
    Markov decision problem
    0 references
    strongly polynomial time
    0 references
    0 references