Pages that link to "Item:Q1945076"

The following pages link to Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076):

Displaying 5 items.

• Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
• The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate (Q2884291) (← links)
• On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
• The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (Q3465936) (← links)
• Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)