Fetching the paper…
Reading the bibliography…
The question of knowing whether the policy Iteration algorithm (PI) for solving Markov Decision Processes (MDPs) has exponential or (strongly) polynomial complexity has attracted much attention in the last 50 years.
On the evolution of random graphs
P. Erdős and A. Rényi · 1960
Earlier work this paper cites.
Dynamic Programming and Markov Processes
R.A. Howard · 1960
Earlier work this paper cites.
Solving h-horizon, stationary markov decision problems in time proportional to log(h)
P. Tseng · 1990
Earlier work this paper cites.
An analysis of stochastic shortest path problems
D. P. Bertsekas and J. N. Tsitsiklis · 1991
Earlier work this paper cites.
Markov decision processes
M. L. Puterman · 1994
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
S. Brin and L. Page · 1998
Earlier work this paper cites.
On the complexity of policy iteration
Y. Mansour and S. Singh · 1999
Earlier work this paper cites.
A random graph model for power law graphs
W. Aiello, F. Chung, and L. Lu · 2001
Earlier work this paper cites.
Decomposition of the google pagerank and optimal linking strategy
K. Avrachenkov and N. Litvak · 2004
Cited alongside, same era.
A survey on pagerank computing
P. Berkhin · 2005
Cited alongside, same era.
Local aspects of the global ranking of web pages
F. Mathieu and L. Viennot · 2006
Cited alongside, same era.
Dynamic Programming and Optimal Control
D. P. Bertsekas · 2007
Cited alongside, same era.
Maximizing pagerank via outlinks
C. de Kerchove, L. Ninove, and P. Van Dooren · 2008
Cited alongside, same era.
Pagerank optimization by edge selection
B. C. Csáji, R. M. Jungers, and V. D. Blondel · 2009
Cited alongside, same era.
Computing the pagerank variation for fragile web data
H. Ishii and R. Tempo · 2009
Later among the works it cites.
Ergodic control and polyhedral approaches to pagerank optimization
O. Fercoq, M. Akian, M. Bouhtou, and S. Gaubert · 2010
Later among the works it cites.
Exponential lower bounds for policy iteration
J. Fearnley · 2010
Later among the works it cites.
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
T. D. Hansen, P. B. Miltersen, and U. Zwick · 2010
Later among the works it cites.
Lower bounds for howard’s algorithm for finding minimum mean-cost cycles
T. Hansen and U. Zwick · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Search engine optimization - best practice guide
D. Chaffey, C. Lake, and A. Friedlein · 2009
Cited alongside, same era.
Discounted deterministic markov decision processes and discounted all-pairs shortest paths
O. Madani, M. Thorup, and U. Zwick · 2010
Later among the works it cites.
The simplex method is strongly polynomial for the markov decision problem with a fixed discount rate
Y. Ye · 2010
Later among the works it cites.