Advertisement

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

  • Manousos RigakisEmail author
  • Dimitra Trachanatzi
  • Magdalene Marinaki
  • Yannis Marinakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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 

Notes

Acknowledgments

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

References

  1. 1.
    Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)zbMATHGoogle Scholar
  2. 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. 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. 4.
    Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687–697 (2008)CrossRefGoogle Scholar
  5. 5.
    Kendall, G., Yao, X., Chong, S.Y.: The Iterated Prisoners’ Dilemma: 20 Years On, vol. 4. World Scientific, Singapore (2007). 261 pCrossRefGoogle Scholar
  6. 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. 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)CrossRefGoogle Scholar
  8. 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. 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)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Tucker, A.W.: A two-person dilemma. In: Readings in Games and Information (1950)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Manousos Rigakis
    • 1
    Email author
  • Dimitra Trachanatzi
    • 1
  • Magdalene Marinaki
    • 1
  • Yannis Marinakis
    • 1
  1. 1.School of Production Engineering and ManagementTechnical University of CreteChaniaGreece

Personalised recommendations