In Defense of DEFECT
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 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.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- BERGIN, James & LIPMAN, Bart, 1994.
"Evolution with State-Dependent Mutations,"
CORE Discussion Papers
1994055, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Young H. P., 1993. "An Evolutionary Model of Bargaining," Journal of Economic Theory, Elsevier, vol. 59(1), pages 145-168, February.
- Fudenberg, Drew & Maskin, Eric, 1990.
"Evolution and Cooperation in Noisy Repeated Games,"
American Economic Review,
American Economic Association, vol. 80(2), pages 274-79, May.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Binmore, Kenneth G. & Samuelson, Larry, 1992. "Evolutionary stability in repeated games played by finite automata," Journal of Economic Theory, Elsevier, vol. 57(2), pages 278-305, August.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
- Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993.
"Learning, Mutation, and Long Run Equilibria in Games,"
Econometric Society, vol. 61(1), pages 29-56, January.
- Kandori, M. & Mailath, G.J., 1991. "Learning, Mutation, And Long Run Equilibria In Games," Papers 71, Princeton, Woodrow Wilson School - John M. Olin Program.
- M. Kandori & G. Mailath & R. Rob, 1999. "Learning, Mutation and Long Run Equilibria in Games," Levine's Working Paper Archive 500, David K. Levine.
- Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
- Cooper, David J., 1996. "Supergames Played by Finite Automata with Finite Costs of Complexity in an Evolutionary Setting," Journal of Economic Theory, Elsevier, vol. 68(1), pages 266-275, January.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:39:y:2002:i:2:p:309-321. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.