Pages that link to "Item:Q2450614"
From MaRDI portal
The following pages link to Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems (Q2450614):
Displaying 5 items.
- 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)
- Reduction of total-cost and average-cost MDPs with weakly continuous transition probabilities to discounted mdps (Q2417095) (← links)
- On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
- A Strongly Polynomial Algorithm for Controlled Queues (Q3169077) (← links)