Finitely Repeated Games with Finite Automata

Citation:

Abraham Neyman. 1998. “Finitely Repeated Games With Finite Automata”. Mathematics Of Operations Research, 23, Pp. 513–552.

Abstract:

Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given finite alphabet, has an equilibrium payoff.