The following pages link to (Q3730373):
Displaying 4 items.
- A polynomial time bound for Howard's policy improvement algorithm (Q1079511) (← links)
- Bounds for the quality and the number of steps in Bellman's value iteration algorithm (Q1317533) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- Improved and Generalized Upper Bounds on the Complexity of Policy Iteration (Q3186525) (← links)