Finitely Repeated Games with Finite Automata

Citation:

Neyman A. Finitely Repeated Games with Finite Automata. Mathematics of Operations Research. 1998;23 :513--552.
Paper2.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.

Last updated on 06/16/2015