Citation:
Neyman A. Finitely Repeated Games with Finite Automata. Mathematics of Operations Research. 1998;23 :513--552.
Paper | 2.01 MB |
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.
See also: Repeated games, Repeated games and complexity