We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing strategies which are implementable by a machine with a bound on its complexity. One player must use a finite automaton while the other player must use a finite perceptron. Some examples illustrate that the sets of strategies which are induced by these two types of machines are different and not ordered by set inclusion. The main result establishes that a cooperation in almost all stages of the game is an equilibrium outcome if the complexity of the machines players may use is limited enough. This result persists when there are more than T states in the player’s automaton, where T is the duration of the repeated game. We further consider the finitely repeated prisoner’s dilemma in which the two players are restricted to choosing strategies which are implementable by perceptrons and prove that players can cooperate in most of the stages provided that the complexity of their perceptrons is sufficiently reduced.
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.
Publisher Info
Paper provided by Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim in its series Sonderforschungsbereich 504 Publications with number
07-58.
Length: 28 pages Date of creation: 06 Aug 2007 Date of revision: Handle: RePEc:xrs:sfbmaa:07-58
Note: Financial support from the Deutsche Forschungsgemeinschaft, SFB 504, at the University of Mannheim, is gratefully acknowledged. Contact details of provider: Postal: D-68131 Mannheim Phone: (49) (0) 621-292-2547 Fax: (49) (0) 621-292-5594 Email: Web page: http://www.sfb504.uni-mannheim.de/ More information through EDIRC
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.: