The political scientist Robert Axelrod once held a computer tournament designed to determine the most successful strategy for approaching the prisoner's dilemma (the strategy that would win out most often on a sustained basis). What he found was that the most successful strategy was loosely based on a pattern of ____.
A)cooperating first and then shifting into competing
B)constant cooperation
C)reciprocity
D)competing first and then shifting into cooperating

Question

Quizplus · Accepted Answer

The most successful strategy found by Robert Axelrod for the prisoner's dilemma was "Tit for Tat," which is based on reciprocity. This strategy involves cooperating on the first move and then mirroring the opponent's previous move.

The Political Scientist Robert Axelrod Once Held a Computer Tournament