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

Evolution of iterated prisoner's dilemma strategies with different history lengths in static and cultural environments

Published: 11 March 2007 Publication History

Abstract

We investigate evolutionary approaches to generate well-performing strategies for the iterated prisoner's dilemma (IPD) with different history lengths in static and cultural environments. The length of the history determines the number of the most recent moves of both players taken into account for the current move decision. The static environment constituting the opponents of the evolved players is made up of ten standard strategies known from the literature. The cultural environment starts with the standard strategies and gradually increases by addition of the best evolved players representing a culture. The performance of the various evolved strategies is compared in specific tournaments. Also, the behavior of an evolved player is analyzed in more detail by looking at the specific game sequences (and corresponding decisions), which out of all possible sequences are actually utilized in a tournament.

References

[1]
D. Ashlock and E.-Y. Kim. Techniques for Analysis of Evolved Prisoner's Dilemma Strategies with Fingerprints. In Proceedings of the Congress on Evolutionary Computation 2005, September 2005.
[2]
R. Axelrod. The Evolution of Cooperation. Basic Books, New York, 1984.
[3]
B. Beaufils, J.-P. Delahaye, and P. Mathieu. Our Meeting With Gradual: A Good Strategy for the Classical Iterated Prisoner's Dilemma. In Proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems 1996, Cambridge, MA, May 1996. MIT Press.
[4]
J. Bendor and P. Swistak. The Evolutionary Stability of Cooperations. American Political Science Review, 91(2):290--307, June 1997.
[5]
R. Boyd and J. Lorberbaum. No Pure Strategy is Evolutionarily Stable in the repeated Prisoner's Dilemma Game. Nature, 327:58--59, May 1987.
[6]
J. Golbeck. Evolving Strategies for the Prisoner's Dilemma. In Advances in Intelligent Systems, Fuzzy Systems, and Evolutionary Computation 2002, pages 299--306, February 2002.
[7]
P. Hingston and G. Kendall. Learning versus Evolution in Iterated Prisoner's Dilemma. In Proceedings of the Congress on Evolutionary Computation 2004, pages 364--372, June 2004.
[8]
C. O'Riordan. A forgiving strategy for the Iterated Prisoners Dilemma. Journal of Artificial Societies and Social Simulation, 3(4), October 2000. (http://jasss.soc.surrey.ac.uk/3/4/3.html).
[9]
R. G. Reynolds and W. Sverdlik. Problem Solving Using Cultural Algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 645--650. IEEE, 1994.
[10]
M. J. Smith. Evolution and the Theory of Games. Cambridge University Press, UK, 1982.

Cited By

View all
  • (2024)Decision Making in Artificial Social ConditionsIntelligent Systems and Applications10.1007/978-3-031-66336-9_9(124-132)Online publication date: 1-Aug-2024
  • (2013)Massively Parallel Model of Extended Memory Use in Evolutionary Game DynamicsProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2013.102(1217-1228)Online publication date: 20-May-2013
  • (2007)Automatic Personalized Spam Filtering through Significant Word ModelingProceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 0210.1109/ICTAI.2007.61(291-298)Online publication date: 29-Oct-2007

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
March 2007
1688 pages
ISBN:1595934804
DOI:10.1145/1244002
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 March 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cultural algorithms
  2. evolutionary computation
  3. iterated prisoner's dilemma

Qualifiers

  • Article

Conference

SAC07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Decision Making in Artificial Social ConditionsIntelligent Systems and Applications10.1007/978-3-031-66336-9_9(124-132)Online publication date: 1-Aug-2024
  • (2013)Massively Parallel Model of Extended Memory Use in Evolutionary Game DynamicsProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2013.102(1217-1228)Online publication date: 20-May-2013
  • (2007)Automatic Personalized Spam Filtering through Significant Word ModelingProceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 0210.1109/ICTAI.2007.61(291-298)Online publication date: 29-Oct-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media