This paper studies the repeated Prisoner’s Dilemma in a local interaction setup. We construct a sequential equilibrium in pure strategies that sustains cooperation for suffciently patient players. The strategy is embedded in an explicitly defined expectation system, which is a more compact way than machines to describe strategies in the local interaction setup, although essentially the expectation system can also be viewed as a finite state automaton. The belief system is derived by perturbing the strategy appropriately and following the principle that parsimonious explanations receive all the weight. The equilibrium has the property that after any global history, full cooperation will be restored after a finite number of periods.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: