Advanced Search
MyIDEAS: Login to save this paper or follow this series

Tit-for-Tat or Win-Stay, Lose-Shift?

Contents:

Author Info

  • Imhof, Lorens
  • Nowak, Martin
  • Fudenberg, Drew

Abstract

The repeated Prisoner's Dilemma is usually known as a story of tit-for-tat (TFT). This remarkable strategy has won both of Robert Axelrod's tournaments. TFT does whatever the opponent has done in the previous round. It will cooperate if the opponent has cooperated, and it will defect if the opponent has defected. But TFT has two weaknesses: (i) it cannot correct mistakes (erroneous moves) and (ii) a population of TFT players is undermined by random drift when mutant strategies appear which play always-cooperate (ALLC). Another equally simple strategy called ‘win-stay, lose-shift’ (WSLS) has neither of these two disadvantages. WSLS repeats the previous move if the resulting payoff has met its aspiration level and changes otherwise. Here, we use a novel approach of stochastic evolutionary game dynamics in finite populations to study mutation–selection dynamics in the presence of erroneous moves. We compare four strategies: always-defect (ALLD), ALLC, TFT and WSLS. There are two possible outcomes: if the benefit of cooperation is below a critical value then ALLD is selected; if the benefit of cooperation is above this critical value then WSLS is selected. TFT is never selected in this evolutionary process, but lowers the selection threshold for WSLS.

Download Info

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.
File URL: http://dash.harvard.edu/bitstream/handle/1/3200671/fudenberg_titfortat.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Harvard University Department of Economics in its series Scholarly Articles with number 3200671.

as in new window
Length:
Date of creation: 2007
Date of revision:
Publication status: Published in Journal of Theoretical Biology
Handle: RePEc:hrv:faseco:3200671

Contact details of provider:
Postal: Littauer Center, Cambridge, MA 02138
Phone: 617-495-2144
Fax: 617-495-7730
Web page: http://www.economics.harvard.edu/
More information through EDIRC

Related research

Keywords:

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, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, Econometric Society, vol. 54(3), pages 533-54, May.
  2. D. Fudenberg & E. Maskin, 2010. "Evolution and Cooperation in Noisy Repeated Games," Levine's Working Paper Archive 546, David K. Levine.
  3. Drew Fudenberg & David K. Levine, 1998. "The Theory of Learning in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061945, December.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. Breitmoser, Yves, 2012. "Cooperation, but no reciprocity: Individual strategies in the repeated Prisoner's Dilemma," MPRA Paper 41731, University Library of Munich, Germany.
  2. Wang, Tao & Chen, Zhigang & Li, Kenli & Deng, Xiaoheng & Li, Deng, 2014. "Memory does not necessarily promote cooperation in dilemma games," Physica A: Statistical Mechanics and its Applications, Elsevier, Elsevier, vol. 395(C), pages 218-227.
  3. Dal Bó, Pedro & Fréchette, Guillaume R., 2013. "Strategy choice in the infinitely repeated prisoners' dilemma," Discussion Papers, Research Unit: Economics of Change SP II 2013-311, Social Science Research Center Berlin (WZB).
  4. Drew Fudenberg & David G. Rand & Anna Dreber, 2012. "Slow to Anger and Fast to Forgive: Cooperation in an Uncertain World," American Economic Review, American Economic Association, American Economic Association, vol. 102(2), pages 720-49, April.
  5. Pedro Dal Bó & Enrique R. Pujals, 2013. "The Evolutionary Robustness of Forgiveness and Cooperation," Working Papers 2013-5, Brown University, Department of Economics.
  6. Ochea, Marius-Ionut, 2013. "Evolution of repeated prisoner's dilemma play under logit dynamics," Journal of Economic Dynamics and Control, Elsevier, Elsevier, vol. 37(12), pages 2483-2499.
  7. Ochea, M., 2012. "Evolution of Repeated Prisoner's Dilemma Play under Logit Dynamics," CeNDEF Working Papers 12-10, Universiteit van Amsterdam, Center for Nonlinear Dynamics in Economics and Finance.

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:hrv:faseco:3200671. 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: (Ben Steinberg).

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.