Welcome to
Cooperation Commons: Interdisciplinary study of cooperation and collective action.
Welcome to NavigationRecent Summaries
|
How To Cope With Noise in the Iterated Prisoner's DilemmaSummary of: How To Cope With Noise in the Iterated Prisoner's Dilemma
The Tit-for-Tat strategy is vulnerable to noise – errors in implementing choices – that can lead to echoing defections, but can be made less sensitive by adding generosity (occasionally refraining from punishing defection by opponent) and contrition (refraining from punishing a reaction to accidental defection.)" DisciplinesKeywordsPublication Reference
Findings
Axelrod became concerned with the problem of noise – mistaken defections in Prisoner's Dilemma games that can lead to echoing repetitions – during the Cuban Missile crisis. Adding generosity and contrition to Tit-for-Tat and reimplementing the 63 rules of the original iterated Prisoner's Dilemma tournament proved to be an effective way of coping with noise; Win-Stay, Lose-Shift did not do as well in such an environment. Axelrod was able to put Soviet and US nuclear strategists together to play Prisoner's Dilemma in 1988 for an audience of social scientists -- with noise deliberately introduced. This tournament was the basis for Axelrod's statement that "Noise calls for forgiveness, but too much forgiveness invites exploitation." The authors also noted: "Generosity can correct an error by either player, but contrition can only correct one's own error. Thus, when the population of strategies one is likely to meet has not adapted to the presence of noise, a strategy like Generous Tit-for-Tat is likely to be effective. On the other hand, if the strategies of the other players one is likely to meet have already adapted to noise, then a strategy like Contrite Tit-for-Tat is likely to be even more effective because it can correct its own errors and restore mutual cooperation almost immediately." |
Interested in participating? Visit Contact, and choose "Request to Participate". Who's new
User loginSearchWho's onlineThere are currently 0 users and 3 guests online.
|