Skip to main content

A Differential Evolution Algorithm to Develop Strategies for the Iterated Prisoner’s Dilemma

  • 2672 Accesses

Part of the Lecture Notes in Computer Science book series (LNISA,volume 10710)

Abstract

This paper presents the application of the Differential Evolution (DE) algorithm in the most known dilemma in the field of Game Theory, the Prisoner’s Dilemma (PD) that simulates the selfish behavior between rational individuals. This study investigates the suitability of the DE to evolve strategies for the Iterated Prisoner’s Dilemma (IPD), so that each individual in the population represents a complete playing strategy. Two different approaches are presented: a classic DE algorithm and a DE approach with memory. Their results are compared with several benchmark strategies. In addition, the Particle Swarm Optimization (PSO) and the Artificial Bee Colony (ABC) that have been implemented in the same framework are compared with the DE approaches. Overall, the strategies developed by DE outperform all the others. Also, it has been observed over iterations that when the DE algorithm is used the player manages to learn his opponent, therefore, DE converges with a quick and efficient manner.

Keywords

  • Differential evolution
  • Game theory
  • Iterated Prisoner’s Dilemma

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-72926-8_12
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-319-72926-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.00
Price excludes VAT (USA)
Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

References

  1. Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)

    MATH  Google Scholar 

  2. Axelrod, R.: The evolution of strategies in the iterated prisoner’s dilemma. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 32–41. Morgan Kaufman, Los Altos, CA (1987)

    Google Scholar 

  3. Haider, S.A., Bukhari, A.S.: Using genetic algorithms to develop strategies for Prisoner’s dilemma. Asian J. Inf. Technol. 5(8), 866–871 (2006)

    Google Scholar 

  4. Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687–697 (2008)

    CrossRef  Google Scholar 

  5. Kendall, G., Yao, X., Chong, S.Y.: The Iterated Prisoners’ Dilemma: 20 Years On, vol. 4. World Scientific, Singapore (2007). 261 p

    CrossRef  Google Scholar 

  6. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Service Center, Piscataway (1995)

    Google Scholar 

  7. Mittal, S., Deb, K.: Optimal strategies of the Iterated Prisoner’s Dilemma problem for multiple conflicting objectives. IEEE Trans. Evol. Comput. 13(3), 554–565 (2009)

    CrossRef  Google Scholar 

  8. Rigakis, M., Trachanatzi, D., Marinaki, M., Marinakis, Y.: Artificial bee colony optimization approach to develop strategies for the iterated prisoners dilemma. In: 7th International Conference of Bionspired Methods and Their Applications, Bled, Slovenia, pp. 18–20 (2016)

    Google Scholar 

  9. Storn, R., Price, K.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)

    MathSciNet  CrossRef  Google Scholar 

  10. Tucker, A.W.: A two-person dilemma. In: Readings in Games and Information (1950)

    Google Scholar 

Download references

Acknowledgments

This work was partially financed by the School of Production Engineering and Management of the Technical University of Crete, as postgraduate research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manousos Rigakis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Rigakis, M., Trachanatzi, D., Marinaki, M., Marinakis, Y. (2018). A Differential Evolution Algorithm to Develop Strategies for the Iterated Prisoner’s Dilemma. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R. (eds) Machine Learning, Optimization, and Big Data. MOD 2017. Lecture Notes in Computer Science(), vol 10710. Springer, Cham. https://doi.org/10.1007/978-3-319-72926-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72926-8_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72925-1

  • Online ISBN: 978-3-319-72926-8

  • eBook Packages: Computer ScienceComputer Science (R0)