IDEAS home Printed from https://ideas.repec.org/p/isu/genres/10125.html

In Defense of Defect

Author

Listed:
  • Volij, Oscar

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 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.

Suggested Citation

  • Volij, Oscar, 2002. "In Defense of Defect," Staff General Research Papers Archive 10125, Iowa State University, Department of Economics.
    • Handle: RePEc:isu:genres:10125
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jones, Matthew T., 2014. "Strategic complexity and cooperation: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 106(C), pages 352-366.
    2. van Veelen, Matthijs & García, Julián, 2019. "In and out of equilibrium II: Evolution in repeated games with discounting and complexity costs," Games and Economic Behavior, Elsevier, vol. 115(C), pages 113-130.
    3. Izquierdo, Luis R. & Izquierdo, Segismundo S. & Vega-Redondo, Fernando, 2014. "Leave and let leave: A sufficient condition to explain the evolutionary emergence of cooperation," Journal of Economic Dynamics and Control, Elsevier, vol. 46(C), pages 91-113.
    4. Matthijs van Veelen & Benjamin Allen & Moshe Hoffman & Burton Simon & Carl Veller, 2016. "Inclusive Fitness," Tinbergen Institute Discussion Papers 16-055/I, Tinbergen Institute.
    5. Samuelson, Larry & Swinkels, Jeroen M., 2003. "Evolutionary stability and lexicographic preferences," Games and Economic Behavior, Elsevier, vol. 44(2), pages 332-342, August.
    6. Christos Ioannou, 2014. "Coevolution of finite automata with errors," Journal of Evolutionary Economics, Springer, vol. 24(3), pages 541-571, July.
    7. Pedro Dal Bo & Guillaume R. Frochette, 2011. "The Evolution of Cooperation in Infinitely Repeated Games: Experimental Evidence," American Economic Review, American Economic Association, vol. 101(1), pages 411-429, February.
    8. Christopher Graser & Matthijs van Veelen, 2024. "Repeated prisoner’s dilemmas with errors: how much subgame-perfection, how much forgiveness, and how much cooperation?," Tinbergen Institute Discussion Papers 24-022/I, Tinbergen Institute.
    9. Heller, Yuval, 2013. "Language, Meaning, and Games: Comment," MPRA Paper 49375, University Library of Munich, Germany.
    10. García, Julián & van Veelen, Matthijs, 2016. "In and out of equilibrium I: Evolution of strategies in repeated games with discounting," Journal of Economic Theory, Elsevier, vol. 161(C), pages 161-189.
    11. Christopher Graser & Takako Fujiwara-Greve & Julián García & Matthijs van Veelen, 2025. "Repeated games with partner choice," PLOS Computational Biology, Public Library of Science, vol. 21(2), pages 1-19, February.
    12. Andreozzi, Luciano, 2013. "Evolutionary stability in repeated extensive games played by finite automata," Games and Economic Behavior, Elsevier, vol. 79(C), pages 67-74.
    13. Pedro Dal BÛ & Enrique R. Pujals, 2013. "The Evolutionary Robustness of Forgiveness and Cooperation," Working Papers 2013-5, Brown University, Department of Economics.
    14. Maenner, Eliot, 2008. "Adaptation and complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 63(1), pages 166-187, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:isu:genres:10125. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Curtis Balmer (email available below). General contact details of provider: https://edirc.repec.org/data/deiasus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.