Abstract
This work merges ideas from two very different areas: Particle Swarm Optimisation and Evolutionary Game Theory. In particular, we are looking to integrate strategies from the Prisoner Dilemma, namely cooperate and defect, into the Particle Swarm Optimisation algorithm. These strategies represent different methods to evaluate each particle's next position. At each iteration, a particle chooses to use one or the other strategy according to the outcome at the previous iteration (variation in its fitness). We compare some variations of the newly introduced algorithm with the standard Particle Swarm Optimiser on five benchmark problems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Di Chio, C., Di Chio, P., & Giacobini, M. (2008). An evolutionary Game-Theoretical approach to Particle Swarm Optimisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 575–584). https://doi.org/10.1007/978-3-540-78761-7_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.