On the efficiency of algebraic simplex algorithms for solving MDPs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- A subexponential bound for linear programming
- An exponential lower bound for Zadeh's pivot rule
- Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
- Discrete Dynamic Programming
- Finding short paths on polytopes by the shadow vertex algorithm
- Geometric random edge
- Improved deterministic algorithms for linear programming in low dimensions
- Jumping Doesn’t Help in Abstract Cubes
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear Programming in Linear Time When the Dimension Is Fixed
- Planning with Markov decision processes. An AI perspective
- Polynomial algorithms in linear programming
- Stochastic Games
- The Complexity of Markov Decision Processes
- The Random‐Facet simplex algorithm on combinatorial cubes
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
- The simplex method is strongly polynomial for deterministic Markov decision processes
- Two New Bounds for the Random‐Edge Simplex‐Algorithm
- Worst case behavior of the steepest edge simplex method
This page was built for publication: On the efficiency of algebraic simplex algorithms for solving MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897978)
