Two-person repeated games with finite automata
Two-person repeated games are studied in which there is a bound on the complexity of strategies for only one of the players. The complexity of a strategy is defined as the smallest number of states of an automaton required to implement it. The asymptotic behavior of the set of equilibrium payoffs is studied as the bound on the strategic complexity of the restricted player tends to infinity, but sufficiently slowly.
scientific article; zbMATH DE number 2051497