Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. Hansen, T. D., Miltersen, P. B., & Zwick, U. Journal of the ACM (J. ACM), 60(1):1:1–1:16, ACM, New York, NY, USA, 2013.
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor [link]Paper  doi  bibtex   
@article{HMZ13,
	Acmid = {2432623},
	Address = {New York, NY, USA},
	Articleno = {1},
	Author = {Hansen, Thomas Dueholm and Miltersen, Peter Bro and Zwick, Uri},
	Date-Added = {2014-11-14 04:07:28 +0000},
	Date-Modified = {2014-11-14 04:07:44 +0000},
	Doi = {10.1145/2432622.2432623},
	Issn = {0004-5411},
	Issue_Date = {February 2013},
	Journal = {Journal of the ACM (J. ACM)},
	Keywords = {Markov decision processes, policy iteration, strategy iteration, strongly polynomial algorithms, turn-based stochastic games},
	Number = {1},
	Numpages = {16},
	Pages = {1:1--1:16},
	Publisher = {ACM},
	Title = {Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor},
	Url = {http://doi.acm.org/10.1145/2432622.2432623},
	Volume = {60},
	Year = {2013},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2432622.2432623},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2432622.2432623}}

Downloads: 0