The Complexity of Stochastic Games

[1]  Anne Condon,et al.  Computational models of games , 1989, ACM distinguished dissertations.

[2]  O. J. Vrieze,et al.  Surveys in game theory and related topics , 1987 .

[3]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  J. Filar.  Ordered field property for stochastic games when the player who controls transitions changes from state to state , 1981 .

[5]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[6]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[7]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[8]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[9]  R. Howard.  Dynamic Programming and Markov Processes , 1960 .

[10]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.