Uniform Turnpike Theorems for Finite Markov Decision Processes (Q5108234): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The value iteration algorithm is not strongly polynomial for discounted dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4118034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in discounted Markovian decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of turnpike theory: towards the discounted deterministic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turnpike Planning Horizons for a Markovian Decision Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Policy Regions for Markov Processes with Discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving H-horizon, stationary Markov decision problems in time proportional to log (H) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of the Turnpike Phenomenon in Discrete-Time Optimal Control Problems / rank
 
Normal rank

Revision as of 13:12, 22 July 2024

scientific article; zbMATH DE number 7195291
Language Label Description Also known as
English
Uniform Turnpike Theorems for Finite Markov Decision Processes
scientific article; zbMATH DE number 7195291

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references