1. Marianne Akian and Stéphane Gaubert . 2013. Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial. arXiv: Optimization and Control ( 2013 ). Marianne Akian and Stéphane Gaubert. 2013. Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial. arXiv: Optimization and Control (2013).
2. Richard E. Bellman . 1957. Dynamic Programming . Princeton University Press . 392 pages. Richard E. Bellman. 1957. Dynamic Programming. Princeton University Press. 392 pages.
3. Dimitri P. Bertsekas and John N. Tsitsiklis. 1989. Convergence Rate and Termination of Asynchronous Iterative Algorithms . In Proceedings of the 3rd International Conference on Supercomputing. Association for Computing Machinery, 461--470 . Dimitri P. Bertsekas and John N. Tsitsiklis. 1989. Convergence Rate and Termination of Asynchronous Iterative Algorithms. In Proceedings of the 3rd International Conference on Supercomputing. Association for Computing Machinery, 461--470.