Cooperation, Repetition, and Automata

作者: Abraham Neyman

DOI: 10.1007/978-3-642-60454-6_16

关键词: Discrete mathematicsMobile automatonTimed automatonNondeterministic finite automatonTwo-way deterministic finite automatonTheoretical computer scienceDeterministic automatonMathematicsProbabilistic automatonω-automatonBüchi automaton

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

参考文章(24)
R. J. Aumann, Survey of Repeated Games Essays in Game Theory and Mathematical Economics in Honor of Oskar Morgenstern. ,(1981)
Robert J. Aumann, Oskar Morgenstern, Essays in game theory and mathematical economics in honor of Oskar Morgenstern Bibliographisches Institut. ,(1981)
Tatsuro Ichiishi, Abraham Neyman, Yair Tauman, Game Theory and Applications Harcourt Brace Jovanovich,. ,(1990)
EHUD KALAI, Bounded Rationality and Strategic Complexity in Repeated Games Game Theory and Applications. pp. 131- 157 ,(1990) , 10.1016/B978-0-12-370182-4.50010-6
Nimrod Megiddo, Avi Wigderson, On play by means of computing machines theoretical aspects of rationality and knowledge. pp. 259- 274 ,(1986) , 10.1016/B978-0-934613-04-0.50022-3
Vijay Krishna, Jean-Pierre Benoit, Nash equilibria of finitely repeated games International Journal of Game Theory. ,vol. 16, pp. 197- 204 ,(1987) , 10.1007/BF01756291
Ehud Lehrer, Finitely Many Players with Bounded Recall in Infinitely Repeated Games Games and Economic Behavior. ,vol. 7, pp. 390- 405 ,(1994) , 10.1006/GAME.1994.1058
Robert J Aumann, Sylvain Sorin, Cooperation and bounded recall Games and Economic Behavior. ,vol. 1, pp. 5- 39 ,(1989) , 10.1016/0899-8256(89)90003-1
Kazuoki Azuma, Weighted sums of certain dependent random variables Tohoku Mathematical Journal. ,vol. 19, pp. 357- 367 ,(1967) , 10.2748/TMJ/1178243286