Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/32931
Title: Is Tit-for-Tat the Answer? On the Conclusions Drawn from Axelrod's Tournaments
Authors: Rapoport, Amnon
Seale, Darryl A.
Colman, Andrew M.
First Published: 30-Jul-2015
Publisher: PLoS
Citation: PLoS One, 10 (7), e0134128
Abstract: Axelrod's celebrated Prisoner's Dilemma computer tournaments, published in the early 1980s, were designed to find effective ways of acting in everyday interactions with the strategic properties of the iterated Prisoner's Dilemma game. The winner of both tournaments was tit-for-tat, a program that cooperates on the first round and then, on every subsequent round, copies the co-player's choice from the previous round. This has been interpreted as evidence that tit-for-tat is an effective general-purpose strategy. By re-analyzing data from the first tournament and some more recent data, we provide new results suggesting that the efficacy of tit-for-tat is contingent on the design of the tournament, the criterion used to determine success, and the particular values chosen for the Prisoner's Dilemma payoff matrix. We argue that this places in doubt the generality of the results and the policy implications drawn from them.
DOI Link: 10.1371/journal.pone.0134128
eISSN: 1932-6203
Links: http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0134128
http://hdl.handle.net/2381/32931
Version: Publisher Version
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © 2015 Rapoport et al. This is an open access article distributed under the terms of the Creative Commons Attribution License ( http://creativecommons.org/licenses/by/4.0/ ) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Appears in Collections:Published Articles, College of Medicine, Biological Sciences and Psychology

Files in This Item:
File Description SizeFormat 
istitfor.pdfPublished (publisher PDF)221.72 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.