Finitely Repeated Games with Finite Automata

Published Online:https://doi.org/10.1287/moor.23.3.513

References

  • Aumann R. J. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games, Vol. IV, Ann. of Math. Stud. (1959) 40 (Princeton University Press, Princeton, New Jersey) 287 324 CrossrefGoogle Scholar
  • Aumann R. J. Acceptable points in games of perfect information. Pacific J. Math. (1960) 10 381 387 CrossrefGoogle Scholar
  • Aumann R. J. Survey of repeated games. Essays in Game Theory and Mathematical Economics in Honor of Oskar Morgenstern (1981) (Wissenschaftsverlag, Bibliographisches Institut, Mannheim, Wien, Zurich) 11 42 Google Scholar
  • Aumann R. J. , Shapley L. S. , Meggido N. Long term competition—A game theoretic approach. Essays in Game Theory in Honor of Michael Maschler (1994) (Springer-Verlag, Berlin) 1 15 CrossrefGoogle Scholar
  • Benoit J.-P. , Krishna V. Finitely repeated games. Econometrica (1985) 53 905 922 CrossrefGoogle Scholar
  • Benoit J.-P. , Krishna V. Nash equilibria of finitely repeated games. Internat. J. Game Theory (1987) 16 197 204 CrossrefGoogle Scholar
  • Ben-Porath E. Repeated games with finite automata. J. Econom. Theory (1993) 59 17 32 CrossrefGoogle Scholar
  • Fudenberg D. , Maskin E. The folk theorem in repeated games with discounting and with incomplete information. Econometrica (1986) 54 533 554 CrossrefGoogle Scholar
  • Gossner O. The folk theorem for finitely repeated games with mixed strategies. Internat. J. Game Theory (1995) 24 95 107 CrossrefGoogle Scholar
  • Kalai E. , Ichiishi T. , Neyman A. , Tauman Y. Bounded rationality and strategic complexity in repeated games. Game Theory and Applications (1990) (Academic Press, New York) 131 157 CrossrefGoogle Scholar
  • Megiddo N. , Wigderson A. , Halpern J. On play by means of computing machines. Proc. 1st Cong. on Theoret. Aspects of Reasoning and Knowledge (1986) (Morgan Kaufman, Los Altos, California) 259 274 CrossrefGoogle Scholar
  • Neyman A. Bounded complexity justifies cooperation in the finitely repeated prisoner's dilemma. Economics Lett. (1985) 19 227 229 CrossrefGoogle Scholar
  • Neyman A. , Hart S. , Colell A. Mas . Cooperation, repetition, and automata. Cooperation: Game-Theoretic Approaches (1997) 155 (Springer-Verlag) 233 255 . NATO ASI Series F CrossrefGoogle Scholar
  • Neyman A. , Okada D. Strategic Entropy and Complexity in Repeated Games (1996) . DP 104, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. Forthcoming in Games and Econom. Behavior Google Scholar
  • Papadimitriou C. H. , Yannakakis M. On complexity as bounded rationality, (extended abstract). (1994) 726 733 . STOC-94 Google Scholar
  • Papadimitriou C. H. , Yannakakis M. On bounded rationality and complexity, manuscript (1995, revised 1996). (1995, 1996) Google Scholar
  • Rubinstein A. , Meggido N. Equilibrium in supergames. Essays in Game Theory in Honor of Michael Maschler (1994) (Springer-Verlag, Berlin) 17 27 CrossrefGoogle Scholar
  • Sorin S. On repeated games with complete information. Math. Oper. Res. (1986) 11 147 160 LinkGoogle Scholar
  • Sorin S. , Ichiishi T. , Neyman A. , Tauman Y. Supergames. Game Theory and Applications (1990) (Academic Press, New York) 46 63 CrossrefGoogle Scholar
  • Sorin S. , Aumann R. J. , Hart S. Repeated games with complete information. Handbook of Game Theory (1992) (North-Holland, Amsterdam) 71 107 . Chapter 4 Google Scholar
  • Zemel E. Small talk and cooperation: A note on bounded rationality. J. Econom. Theory (1989) 49 1 1 9 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.