ACM Home Page
Please provide us with feedback. Feedback
Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions
Full text PdfPdf (586 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2002 ACM symposium on Applied computing table of contents
Madrid, Spain
SESSION: Agents, interactions, mobility and systems table of contents
Pages: 42 - 48  
Year of Publication: 2002
ISBN:1-58113-445-2
Authors
Bengt Carlsson  Blekinge Institute of Technology, S-372 25 Ronneby, Sweden
K. Ingemar Jönsson  Lund University, Ecology Building, S-223 62 Lund, Sweden
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 56,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/508791.508802
What is a DOI?

ABSTRACT

The prisoner's dilemma has evolved into a standard game for analyzing the success of cooperative strategies in repeated games. With the aim of investigating the behavior of strategies in some alternative games we analyzed the outcome of iterated games for both the prisoner's dilemma and the chicken game. In the chicken game, mutual defection is punished more strongly than in the prisoner's dilemma, and yields the lowest fitness. We also ran our analyses under different levels of noise. The results reveal a striking difference in the outcome between the games. Iterated chicken game needed more generations to find a winning strategy. It also favored nice, forgiving strategies able to forgive a defection from an opponent. In particular the well-known strategy tit-for-tat has a poor successrate under noisy conditions. The chicken game conditions may be relatively common in other sciences, and therefore we suggest that this game should receive more interest as a cooperative game from researchers within computer science.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Axelrod, R. 1980a. Effective Choice in the Prisoner's Dilemma. J, Confl. Resol., 24: 3-25
 
2
Axelrod, R. 1980b. More Effective Choice in the Prisoner's Dilemma. J. Confl. Resol., 24: 379-403.
 
3
Axelrod, R. 1984. The Evolution of Cooperation, New York: Basic Books.
 
4
Axelrod, R. and Hamilton, W. D. 1981. The evolution of cooperation. Science, 211: 1390-1396.
 
5
Axelrod, R. and Dion, D. 1988. The further evolution of cooperation. Science, 242: 1385-1390.
 
6
Bendor, J. 1993. Uncertainty and the evolution of cooperation. J. Conflict Resolut., 37: 709-734.
 
7
Bendor, J., Kramer, R. M. and Stout, S. 1991. When in doubt: Cooperation in a noisy Prisoner's Dilemma. J. Conflict Resolut., 35: 691-719.
 
8
Boyd, R. 1989. Mistakes allow evolutionary stability in the repeated Prisoner's Dilemma game. J. theor. Biol., 136: 47-56.
 
9
 
10
Carlsson, B., 2001, Simulating how to Cooperate in Iterated Chicken Game and Iterated Prisoner's Dilemma, in eds. Liu, J., Zhong, N., Tang, Y. Y., and Wang, P. S. P., Agent Engineering, Series in Machine Perception and Artificial Intelligence- vol 43, World Scientific, Singapore.
 
11
 
12
Koeslag, J. H. 1997. Sex, The Prisoner's Dilemma Game, and the Evolutionary Inevitability of Cooperation. J. theor. Biol., 189: 53-61.
 
13
Lipman, B. L. 1986. Cooperation among egoists in Prisoner's Dilemma and Chicken Game. Public Choice, 51:315-331.
 
14
Luce, R. D., and Raiffa, H. Games and Decisions Dover Publications Inc. 1957.
 
15
Maynard Smith, J. 1982. Evolution and the theory of games. Cambridge: Cambridge University Press.
 
16
Molander, P. 1985. The optimal level of generosity in a selfish, uncertain environment. J. Conflict Resolut., 29: 611-618.
 
17
Nishimura, K. and Stephens D. W. 1997. Iterated Prisoner's Dilemma: Pay-off Variance. J. theor. Biol., 188: 1-10.
 
18
Nowak, M. A. and Sigmund, K. 1992. Tit for tat in heterogeneous populations. Nature, 355: 250-253.
 
19
Nowak, M. A. and Sigmund, K. 1993. A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game. Nature, 364: 56-58.
 
20
Rapoport, A. and Chammah, A. M. 1965. Prisoner's Dilemma: A study in Conflict and Cooperation. Ann Arbor: University of Michigan Press.
 
21
Selten, R., Reexamination of the perfectness concept for equilibrium points in extensive games. International Journal of Game theory, 4:25-55, 1975.
 
22
Snyder, G. 1971. "Prisoner's dilemma" and "Chicken" models in international politics. Int. Stud. Quart., 15: 66-103.
 
23
Wu, J. and Axelrod, R. 1995. How to cope with noise in the iterated Prisoner's Dilemma. J. Conflict Resolut., 39: 183-189.

Collaborative Colleagues:
Bengt Carlsson: colleagues
K. Ingemar Jönsson: colleagues