Pages that link to "Item:Q1785275"
From MaRDI portal
The following pages link to Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275):
Displaying 4 items.
- The value iteration algorithm is not strongly polynomial for discounted dynamic programming (Q1667204) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← 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)
