Abstract
Repeated two-player zero-sum games of finite automata are studied. The players are charged a penalty proportional to the size of their automata to limit the complexity of strategies they can use. The notion of bounded computational capacity equilibrium payoff is thus transferred to the case of zero-sum games. It is proved that the set of bounded computational capacity equilibrium payoffs contains exactly one value, namely the value of the one-shot game, or, equivalently, that the value of the game with penalty approaches the value of the one-shot game as the penalty goes to zero. An estimate of the rate of convergence is also provided.
Similar content being viewed by others
References
Abreu D, Rubinstein A (1988) The structure of Nash equilibrium in repeated games with finite automata. Econometrica 56:1259–1281
Baskov O (2017) Bounded computational capacity equilibrium in repeated two-player zero-sum games. Int Game Theory Rev 19:1–8
Ben-Porath E (1993) Repeated games with finite automata. J Econ Theory 59:17–32
Hernandez P, Solan E (2016) Bounded computational capacity equilibrium. J Econ Theory 163:342–364
Neyman A (1985) Bounded compexity justifies cooperation in the finitely-repeated prisoners’ dilemma. Econ Lett 19:227–229
Rubinstein A (1986) Finite automata play the repeated prisoner’s dilemma. J Econ Theory 39:83–96
Author information
Authors and Affiliations
Corresponding author
Additional information
We would like to express our gratitude to Eilon Solan for numerous suggestions. This research is supported by Russian Foundation for Basic Research, Grant no. 16-01-00124.
Rights and permissions
About this article
Cite this article
Baskov, O.V. Equilibrium payoffs in repeated two-player zero-sum games of finite automata. Int J Game Theory 48, 423–431 (2019). https://doi.org/10.1007/s00182-018-0634-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-018-0634-x