Exponential Lower Bounds for Policy Iteration-Reference-Cited by-同舟云学术

Exponential Lower Bounds for Policy Iteration

Published:2010 Issue: Volume: Page:551-562
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Fearnley John

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14162-1_46.pdf

Reference9 articles.

1. Andersson, D.: Extending Friedmann’s lower bound to the Hoffman-Karp algorithm. Preprint (June 2009)

2. Andersson, D., Hansen, T.D., Miltersen, P.B.: Toward better bounds on policy iteration. Preprint (June 2009)

3. Ash, R.B., Doléans-Dade, C.A.: Probability and Measure Theory. Academic Press, London (2000)

4. Friedmann, O.: A super-polynomial lower bound for the parity game strategy improvement algorithm as we know it. In: Logic in Computer Science (LICS). IEEE, Los Alamitos (2009)

5. Howard, R.: Dynamic Programming and Markov Processes. Technology Press and Wiley (1960)

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Smoothed Complexity of Policy Iteration for Markov Decision Processes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. A Practitioner’s Guide to MDP Model Checking Algorithms;Tools and Algorithms for the Construction and Analysis of Systems;2023

3. Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games;Lecture Notes in Computer Science;2023

4. Geometric Policy Iteration for Markov Decision Processes;Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2022-08-14

5. An exponential lower bound for Zadeh’s pivot rule;Mathematical Programming;2022-07-19