skip to main content
10.1145/508791.508802acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions

Published:11 March 2002Publication History

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

  1. Axelrod, R. 1980a. Effective Choice in the Prisoner's Dilemma. J, Confl. Resol., 24: 3-25]]Google ScholarGoogle ScholarCross RefCross Ref
  2. Axelrod, R. 1980b. More Effective Choice in the Prisoner's Dilemma. J. Confl. Resol., 24: 379-403.]]Google ScholarGoogle ScholarCross RefCross Ref
  3. Axelrod, R. 1984. The Evolution of Cooperation, New York: Basic Books.]]Google ScholarGoogle Scholar
  4. Axelrod, R. and Hamilton, W. D. 1981. The evolution of cooperation. Science, 211: 1390-1396.]]Google ScholarGoogle ScholarCross RefCross Ref
  5. Axelrod, R. and Dion, D. 1988. The further evolution of cooperation. Science, 242: 1385-1390.]]Google ScholarGoogle ScholarCross RefCross Ref
  6. Bendor, J. 1993. Uncertainty and the evolution of cooperation. J. Conflict Resolut., 37: 709-734.]]Google ScholarGoogle ScholarCross RefCross Ref
  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.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. Boyd, R. 1989. Mistakes allow evolutionary stability in the repeated Prisoner's Dilemma game. J. theor. Biol., 136: 47-56.]]Google ScholarGoogle Scholar
  9. Carlsson B. and Johansson, S. 1998. An Iterated Hawk-and-Dove Game. In Agents and Multi-agent Systems. Lecture Notes in Artificial Intelligence 1441 (W. Wobcke, M. Pagnucco, and C. Zhang, eds), pp. 179-192, Berlin: Springer-Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]]Google ScholarGoogle Scholar
  11. Johansson, S., Carlsson, B., and Boman, M. 1998. Modeling strategies as Generous and Greedy in Prisoner's Dilemma-like games. 1998 Proceedings from the Second Asia Pacific Conference on Simulated Evolution and Learning (SEAL98), Canberra.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Koeslag, J. H. 1997. Sex, The Prisoner's Dilemma Game, and the Evolutionary Inevitability of Cooperation. J. theor. Biol., 189: 53-61.]]Google ScholarGoogle Scholar
  13. Lipman, B. L. 1986. Cooperation among egoists in Prisoner's Dilemma and Chicken Game. Public Choice, 51:315-331.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. Luce, R. D., and Raiffa, H. Games and Decisions Dover Publications Inc. 1957.]]Google ScholarGoogle Scholar
  15. Maynard Smith, J. 1982. Evolution and the theory of games. Cambridge: Cambridge University Press.]]Google ScholarGoogle Scholar
  16. Molander, P. 1985. The optimal level of generosity in a selfish, uncertain environment. J. Conflict Resolut., 29: 611-618.]]Google ScholarGoogle ScholarCross RefCross Ref
  17. Nishimura, K. and Stephens D. W. 1997. Iterated Prisoner's Dilemma: Pay-off Variance. J. theor. Biol., 188: 1-10.]]Google ScholarGoogle Scholar
  18. Nowak, M. A. and Sigmund, K. 1992. Tit for tat in heterogeneous populations. Nature, 355: 250-253.]]Google ScholarGoogle ScholarCross RefCross Ref
  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.]]Google ScholarGoogle ScholarCross RefCross Ref
  20. Rapoport, A. and Chammah, A. M. 1965. Prisoner's Dilemma: A study in Conflict and Cooperation. Ann Arbor: University of Michigan Press.]]Google ScholarGoogle Scholar
  21. Selten, R., Reexamination of the perfectness concept for equilibrium points in extensive games. International Journal of Game theory, 4:25-55, 1975.]]Google ScholarGoogle Scholar
  22. Snyder, G. 1971. "Prisoner's dilemma" and "Chicken" models in international politics. Int. Stud. Quart., 15: 66-103.]]Google ScholarGoogle ScholarCross RefCross Ref
  23. Wu, J. and Axelrod, R. 1995. How to cope with noise in the iterated Prisoner's Dilemma. J. Conflict Resolut., 39: 183-189.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '02: Proceedings of the 2002 ACM symposium on Applied computing
        March 2002
        1200 pages
        ISBN:1581134452
        DOI:10.1145/508791

        Copyright © 2002 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 11 March 2002

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader