Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1312.6832
Cited By
The Value Iteration Algorithm is Not Strongly Polynomial for Discounted Dynamic Programming
Operations Research Letters (ORL), 2013
19 December 2013
E. Feinberg
Jefferson Huang
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"The Value Iteration Algorithm is Not Strongly Polynomial for Discounted Dynamic Programming"
5 / 5 papers shown
Revisiting Value Iteration: Unified Analysis of Discounted and Average-Reward Cases
Arsenii Mustafin
Xinyi Sheng
Dominik Baumann
38
0
0
27 Oct 2025
On the Hardness of Reinforcement Learning with Transition Look-Ahead
Corentin Pla
Hugo Richard
Marc Abeille
Nadav Merlis
Vianney Perchet
118
1
0
22 Oct 2025
Geometric Re-Analysis of Classical MDP Solving Algorithms
Arsenii Mustafin
Aleksei Pakharev
Alex Olshevsky
I. Paschalidis
168
1
0
06 Mar 2025
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017
Aaron Sidford
Mengdi Wang
X. Wu
Yinyu Ye
352
142
0
27 Oct 2017
Lower Bound On the Computational Complexity of Discounted Markov Decision Problems
Yichen Chen
Mengdi Wang
225
19
0
20 May 2017
1
Page 1 of 1
