Neyman, Abraham; Okada, Daijiro - In: International Journal of Game Theory 29 (2000) 3, pp. 309-325
We study two-person repeated games in which a player with a restricted set of strategies plays against an unrestricted player. An exogenously given bound on the complexity of strategies, which is measured by the size of the smallest automata that implement them, gives rise to a restriction on...