Cooperation, Secret Handshakes, and Imitation in the Prisoners' Dilemma
In the prisoners' dilemma game, the only evolutionary stable strategy is defection, even though nutual cooperation yields a higher payoff. Building on a paper by Robson (1990), we introduce mutants who have the ability to send a (costly) signal, i.e., the "secret handshake," before each round of the game and to condition their actions on whether or not they observe the same signal from their opponent. A population playing the strategy "always defect" is vulnerable to secret handshake mutants who cooperate when they meet other secret handshakers and defect against tother opponents. However, these secret handshakers are in turn vulberable ot a second round of mutants who imitate the secret handshake and then defect against all opponents. But now a new group of secret handshakers with a different secret handshake can arise. Thus, play can cycle between cooperation and defection. We study the dynamics of that cycling. We show that in the limit, as the probability of mutation goes to zero, cooperation occurs on average half the time. Using simulations to study the implications of our model when the mutation probability is larger than zero, we find that it is possible for cooperation to be sustained for long periods. In general, cooperation is favored when mutual cooperation has aj large payoff advantage over mutual defection, and when the payoff advantage of unilateral defection is small. Surprisingly, however, there are cases where an increased payoff to unilateral defection actually raises the level of cooperation.
(This abstract was borrowed from another version of this item.)
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:37:y:2001:i:1:p:216-242. 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: (Zhang, Lei)
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.