Neyman, Abraham; Spencer, Joel - In: Games and Economic Behavior 69 (2010) 1, pp. 165-168
Let G=<I,J,g> be a two-person zero-sum game. We examine the two-person zero-sum repeated game G(k,m) in which players 1 and 2 place down finite state automata with k,m states respectively and the payoff is the average per-stage payoff when the two automata face off. We are interested in the cases in...</i,j,g>