Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information
暂无分享,去创建一个
[1] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[2] J. Robinson. AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.
[3] R. Bellman. ON A NEW ITERATIVE ALGORITHM FOR FINDING THE SOLUTIONS OF GAMES AND LINEAR PROGRAMMING PROBLEMS , 1953 .
[4] J. Doob. Stochastic processes , 1953 .
[5] L. Shapley,et al. GAMES WITH PARTIAL INFORMATION , 1956 .
[6] J. Harsanyi. Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points , 1968 .
[7] M. Norman. Some convergence theorems for stochastic learning models with distance diminishing operators , 1968 .
[8] S. Zamir,et al. Zero-sum sequential games with incomplete information , 1973 .
[9] S. Lakshmivarahan,et al. Absolutely Expedient Learning Algorithms For Stochastic Automata , 1973 .
[10] S. Zamir. On the Notion of Value for Games with Infinitely Many Stages , 1973 .
[11] V. Crawford. Learning the Optimal Strategy in a Zero-Sum Game , 1974 .
[12] Kumpati S. Narendra,et al. Games of Stochastic Automata , 1974, IEEE Trans. Syst. Man Cybern..
[13] Kumpati S. Narendra,et al. Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..
[14] Elon Kohlberg,et al. Optimal strategies in repeated games with incomplete information , 1975 .
[15] Norio Baba,et al. On the Learning Behavior of Stochastic Automata Under a Nonstationary Random Environment , 1975, IEEE Transactions on Systems, Man, and Cybernetics.
[16] M. J. Sobel,et al. Bayesian games as stochastic processes , 1976 .