Equilibrium payoffs in repeated two-player zero-sum games of finite automata

O. V. Baskov ()
Additional contact information
O. V. Baskov: Saint Petersburg State University

International Journal of Game Theory, 2019, vol. 48, issue 2, No 5, 423-431

Abstract: 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.

Keywords: Matrix games; Zero-sum games; Repeated games; Finite automata (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00182-018-0634-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:48:y:2019:i:2:d:10.1007_s00182-018-0634-x

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-018-0634-x

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().