On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes

@article{Melekopoglou1994OnTC,
  title={On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes},
  author={Mary Melekopoglou and Anne Condon},
  journal={INFORMS Journal on Computing},
  year={1994},
  volume={6},
  pages={188-192}
}
We consider the complexity of the policy improvement algorithm for Markov decision processes. We show that four variants of the algorithm require exponential time in the worst case. 
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Surveys in game theory and related topics, CWI Tract 39

  • H.J.M. Peters, O. J. Vrieze
  • Centrum voor Wiskunde en Informatica,
  • 1987

A Polynomial algorithm in linear programming

  • L. G. Khachiyan
  • Soviet Math Dokl.,
  • 1979
1 Excerpt

How Good is the Simplex Algorithm? Inequalities III, O. Shisha

  • V. Klee, G. Minty
  • 1979

The Computational Complexity of Probabilistic Turing Machines

  • J. Gill
  • SIAM Journal on Computing,
  • 1977

Similar Papers

Loading similar papers…