Strategic Entropy and Complexity in Repeated Games
暂无分享,去创建一个
[1] S. V. Fomin,et al. Ergodic Theory , 1982 .
[2] Mihalis Yannakakis,et al. On complexity as bounded rationality (extended abstract) , 1994, STOC '94.
[3] A. Neyman. Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .
[4] Meir Smorodinsky,et al. Ergodic Theory Entropy , 1971 .
[5] I. H. Öğüş,et al. NATO ASI Series , 1997 .
[6] Daijiro Okada,et al. Two-person repeated games with finite automata , 2000, Int. J. Game Theory.
[7] Eitan Zemel. Small Talk and Cooperation A Note on Bounded Rationality , 1989 .
[8] Abraham Neyman,et al. Finitely Repeated Games with Finite Automata , 1998, Math. Oper. Res..
[9] Elchanan Ben-Porath,et al. Repeated games with Finite Automata , 1993 .
[10] Abraham Neyman,et al. Cooperation, Repetition, and Automata , 1997 .
[11] Robert J. Aumann,et al. Essays in game theory and mathematical economics in honor of Oskar Morgenstern , 1981 .
[12] Ehud Lehrer. Finitely Many Players with Bounded Recall in Infinitely Repeated Games , 1994 .
[13] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[14] R. Aumann. Survey of Repeated Games , 1981 .
[15] E. Lehrer. Repeated Games with Stationary Bounded Recall Strategies , 1988 .
[16] Dov Samet,et al. A note on reactive equilibria in the discounted prisoner's dilemma and associated games , 1988 .
[17] T. Ichiishi,et al. Game Theory and Applications , 1990 .
[18] E. Kalai. Bounded Rationality and Strategic Complexity in Repeated Games , 1987 .