Advanced Search
MyIDEAS: Login

In Defense or Defect or Cooperation Does not Justify the Solution Concept

Contents:

Author Info

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.

(This abstract was borrowed from another version of this item.)

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by Brown University, Department of Economics in its series Working Papers with number 99-26.

as in new window
Length:
Date of creation: 1999
Date of revision:
Handle: RePEc:bro:econwp:99-26

Contact details of provider:
Postal: Department of Economics, Brown University, Providence, RI 02912

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

References

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.:
as in new window
  1. 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.
  2. 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).
  3. Volij, Oscar & Ben-Shoham, Asaf & Serrano, Roberto, 2004. "The Evolution of Exchange," Staff General Research Papers 10247, Iowa State University, Department of Economics.
  4. Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
  5. Fernando Vega-Redondo, 1997. "The Evolution of Walrasian Behavior," Econometrica, Econometric Society, vol. 65(2), pages 375-384, March.
  6. 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.
  7. Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993. "Learning, Mutation, and Long Run Equilibria in Games," Econometrica, Econometric Society, vol. 61(1), pages 29-56, January.
  8. 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.
  9. 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.
  10. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bro:econwp:99-26. 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: (Brown Economics Webmaster).

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.