@article {2755,
	title = {Finitely Repeated Games with Finite Automata},
	journal = {Mathematics of Operations Research},
	volume = {23},
	year = {1998},
	pages = {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.},
	author = {Abraham Neyman}
}
