A Game-Theoretic Approach to the Simple Coevolutionary Algorithm

  • Authors:
  • Sevan G. Ficici;Jordan B. Pollack

  • Affiliations:
  • -;-

  • Venue:
  • PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fundamental distinction between ordinary evolutionary algorithms (EA) and co-evolutionary algorithms lies in the interaction between coevolving entities. We behave that this property is essentially game-theoretic in nature. Using game theory, we describe extensions that allow familiar mixing-matrix and Markov-chain models of EAs to address coevolutionary algorithm dynamics. We then employ concepts from evolutionary game theory to examine design aspects of conventional coevolutionary algorithms that are poorly understood.