PSO approaches to co-evolve IPD strategies

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 356-363

  Franken, Nelis ^a   Engelbrecht, Andries P ^a  

^a UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE PRISONER'S DILEMMA (IPD); NOISY STRUCTURES; PARTICLE FITNESS; PARTICLE SWARM OPTIMIZATION (PSO);

ACOUSTIC NOISE; GAME THEORY; GENETIC ALGORITHMS; INFORMATION ANALYSIS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

NEURAL NETWORKS;

EID: 4344576710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Axelrod. The Evolution of Cooperation Basic Books, 1984.
2. R. Axelrod. Tit-for-tat strategies. In Routledge Encyclopedia of International Political Economy. Routledge, June 2001.
3. R. Axelrod and L. D'Ambrosio. Announcement for bibliography on the evolution of cooperation. Journal of Conflict Resolution. 39:190, 1995.
4. A. D. Blair and J. B. Pollack. What makes a good co-evolutionary learning environment? Australian Journal of Intelligent Information Processing Systems, 4:166-175, 1997.
5. K. Chellapilla and D. B. Fogel. Evolution, neural networks, games, and intelligence. In Proceedings of the IEEE, pages 1471-1496, 1999.
6. K. Chellapilla and D. B. Fogel. Evolving neural networks to play checkers without expert knowledge. IEEE Transactions on Neural Networks, 10(6):1382-1391, 1999.
7. Computational Intelligence Research Group - Swarm Intelligence Research, University of Pretoria, http://cirg.cs.up.ac.za. Accessed on 28 November 2003.
8. P. Darwen and X. Yao. On evolving robust strategies for iterated prisoners dilemma. Progress in Evolutionary Computation, LNAI, 956:276-292, 1995.
9. R. C. Eberhart and J. Kennedy. Swarm Intelligence. Morgan Kaufmann, 2001.
10. N. Franken and A. P. Engelbrecht. Comparing PSO structures to learn the game of checkers from zero knowledge. In Proceedings of the Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, December 2003.
11. J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, volume IV, pages 1942-1948, Perth, Australia, 1995.
12. J. Kennedy and R. C. Eberhart. A discrete binary version of the particle swarm algorithm. In Proceedings of the 1997 Conference on Systems, Man, and Cybernetics, pages 4104 - 4109, 1997.
13. J. Kennedy and R. Mendes. Population structure and particle swarm performance. In Proceedings of Congress on Evolutionary Computing (CEC 2002), Honolulu, Hawaii, 2002.
14. S. Kuhn. Prisoner's dilemma. Stanford Encyclopedia of Philosophy, 1997. http://plato.stanford.edu/entries/prisoner-dilemma.
15. K. Lindgren. Evolutionary phenomena in simple dynamics. Santa Fe Institute Studies in the Sciences of Complexity, 10:295 - 312, 1991.
16. J. Von Neumann and O. Morgenstern. Theory of Games and Economic behaviour. Princeton University Press, 1944.
17. L. F. A. Wessels and E. Barnard. Avoiding false local minima by proper initialization of connections. IEEE Transactions on Neural Networks, 3(6):899-905, 1992.
18. J. Wu and R. Axelrod. How to cope with noise in the iterated prisoner's dilemma. Journal of Conflict Resolution, 39(1): 183-189, 1995.