Pages that link to "Item:Q2661516"
From MaRDI portal
The following pages link to Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516):
Displaying 8 items.
- A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces (Q330284) (← links)
- Bounds for the quality and the number of steps in Bellman's value iteration algorithm (Q1317533) (← links)
- The value iteration algorithm is not strongly polynomial for discounted dynamic programming (Q1667204) (← links)
- A note on policy algorithms for discounted Markov decision problems (Q1969768) (← links)
- Some remarks on the fractal structure of irrigation balls (Q2631653) (← links)
- Interval iteration algorithm for MDPs and IMDPs (Q2636515) (← links)
- Approximate Value Iteration with Temporally Extended Actions (Q2941739) (← links)
- PAC Bounds for Discounted MDPs (Q3164829) (← links)