Cooperation, Repetition, and Automata

This chapter studies the implications of bounding the complexity of players’ strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.

[1]  V. Krishna,et al.  Nash equilibria of finitely repeated games , 1987 .

[2]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[3]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[4]  Mihalis Yannakakis,et al.  On complexity as bounded rationality (extended abstract) , 1994, STOC '94.

[5]  Abraham Neyman,et al.  Finitely Repeated Games with Finite Automata , 1998, Math. Oper. Res..

[6]  A. Neyman.  Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[7]  Avi Wigderson,et al.  On Play by Means of Computing Machines , 1986, TARK.

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  E. Lehrer.  Repeated Games with Stationary Bounded Recall Strategies , 1988 .

[10]  D. Blackwell,et al.  THE BIG MATCH , 1968, Classics in Game Theory.

[11]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[12]  Elchanan Ben-Porath,et al.  Repeated games with Finite Automata , 1993 .

[13]  Ehud Lehrer.  Finitely Many Players with Bounded Recall in Infinitely Repeated Games , 1994 .

[14]  R. Aumann.  Survey of Repeated Games , 1981 .

[15]  Robert J. Aumann,et al.  Essays in game theory and mathematical economics in honor of Oskar Morgenstern , 1981 .

[16]  E. Kalai.  Bounded Rationality and Strategic Complexity in Repeated Games , 1987 .

[17]  Vijay Krishna,et al.  Finitely Repeated Games , 1985 .

[18]  T. Ichiishi,et al.  Game Theory and Applications , 1990 .

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  R. Aumann,et al.  Cooperation and bounded recall , 1989 .

[21]  E. Kalai,et al.  Finite Rationality and Interpersonal Complexity in Repeated Games , 1988 .

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

[23]  On Bounded Rationality And Computational Complexity , 1994 .

[24]  T. Cover.  Hypothesis Testing with Finite Statistics , 1969 .

[25]  Eitan Zemel.  Small Talk and Cooperation A Note on Bounded Rationality , 1989 .

[26]  Françoise Forges,et al.  A counterexample to the folk theorem with discounting , 1986 .