Pages that link to "Item:Q3783096"
From MaRDI portal
The following pages link to Sufficient Classes of Strategies in Discrete Dynamic Programming I: Decomposition of Randomized Strategies and Embedded Models (Q3783096):
Displaying 5 items.
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm (Q300040) (← links)
- Time aggregated Markov decision processes via standard dynamic programming (Q635510) (← links)
- MDPs with setwise continuous transition probabilities (Q2060367) (← links)
- Exact finite approximations of average-cost countable Markov decision processes (Q2440756) (← links)
- Non-randomized strategies in stochastic decision processes (Q2638965) (← links)