@booklet {neyman-frgwfa1995,
	title = {Finitely Repeated Games with Finite Automata},
	howpublished = {Discussion Papers},
	year = {1995},
	month = {6},
	publisher = {(revised indp $\#$161)},
	abstract = {{The paper studies the implication of bounding the complexity of the strategies players may select on the set of equilibrium payoffs in repeated games. The complexity of a strategy is measured by the size of the minimal automaton that can implement it. A finite automaton is an automated machine that implements a strategy; it has a finite number of states and an initial state. It prescribes the action to be taken as a function of the current state and a transition function changing the states of the automaton as a function of its current state and the present actions of the other players. The size of an automaton is its number of states. The Main results imply in particular that in two person repeated games, the equilibrium payoffs of a sequence of such games, G(n)},
	url = {/files/dp69.pdf},
	author = {Abraham Neyman}
}
