Oscar Volij (Department of Economics, Brown University, and Department of Economics, Hebrew University of Jerusalem.)
Abstract
The one-state machine that always defects is the only evolutionarily stable strategy in the machine game that is derived from the prisoners' dilemma, when preferences are lexicographic in the complexity. This machine is the only stochastically stable strategy of the machine game when players are restricted to choosing machines with a uniformly bounded complexity.
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.
Length: Date of creation: 30 Dec 1998 Date of revision:
26 Aug 1999 Publication status: Published in Games and Economic Behavior, 39, 309--321 (2002). Handle: RePEc:nid:ovolij:007
Contact details of provider: Postal: Oscar Volij, Department of Economics, Ben-Gurion University, Beer-Sheva 84105, Israel Web page: http://volij.co.il/
Find related papers by JEL classification: C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
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.: