Pages that link to "Item:Q1667204"
From MaRDI portal
The following pages link to The value iteration algorithm is not strongly polynomial for discounted dynamic programming (Q1667204):
Displayed 10 items.
- Value set iteration for two-person zero-sum Markov games (Q503139) (← links)
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- Uniform Turnpike Theorems for Finite Markov Decision Processes (Q5108234) (← links)
- Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)
- Formalization of methods for the development of autonomous artificial intelligence systems (Q6066037) (← links)