A New Framework for Analysis of Coevolutionary Systems—Directed Graph Representation and Random Walks

  title={A New Framework for Analysis of Coevolutionary Systems—Directed Graph Representation and Random Walks},
  author={S. Y. Chong and P. Tiňo and Jun He and X. Yao},
  journal={Evolutionary Computation},
Studying coevolutionary systems in the context of simplified models (i.e., games with pairwise interactions between coevolving solutions modeled as self plays) remains an open challenge since the rich underlying structures associated with pairwise-comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such as intransitivity in coevolutionary problems), there is no complete characterization of cycle… Expand
1 Citations
Coevolutionary systems and PageRank
A principled approach to measure and rank the performance of solutions (vertices) in a given coevolutionary digraphs with different underlying structures is developed and can precisely quantify changes to the authorities due to modifications in restart probability for any coev evolutionary system. Expand


Complex Coevolutionary Dynamics—Structural Stability and Finite Population Effects
In a simple EGT setting of two-player symmetric games with two pure strategies and a polymorphic equilibrium, it is proved that for (μ,λ), truncation, sequential tournament, best-of-group tournament, and linear ranking selections, the coevolutionary dynamics do not possess the shadowing property. Expand
Cyclic Incrementality in Competitive Coevolution: Evolvability through Pseudo-Baldwinian Switching-Genes
The use of a phenotypic cluster analysis is introduced to examine the distribution of opponent categories throughout an evolutionary sequence, establishing the existence of switching-genes that control opponent specialization and suggesting the retention of dormant genetic adaptations, that is, genetic memory. Expand
A game-theoretic and dynamical-systems analysis of selection methods in coevolution
The results show that many selection methods are inappropriate for finding polymorphic Nash solutions to variable-sum games. Expand
New Methods for Competitive Coevolution
This work uses the games of Nim and 3-D Tic-Tac-Toe as test problems to explore three new techniques in competitive coevolution, which changes the way fitness is measured, shared sampling provides a method for selecting a strong, diverse set of parasites and the hall of fame encourages arms races by saving good individuals from prior generations. Expand
The Dominance Tournament Method of Monitoring Progress in Coevolution
A new method for tracking progress, the dominance tournament, is introduced, which shows how different coevolution runs continue to innovate for different periods of time, reveals the precise generation in each run where stagnation occurs, and identifies the best individuals found during the runs. Expand
A monotonic archive for pareto-coevolution.
It is demonstrated how the approximation of a monotonic algorithm can lead to algorithms that are sufficiently reliable in practice while offering better efficiency, and how archive sizes may be limited while still providing approximate reliability. Expand
Coevolving Game-Playing Agents: Measuring Performance and Intransitivities
A set of measurements to identify cycling in a population and a new algorithm that tries to minimize cycling in strictly competitive games, and is able to find extremely strong value functions of this type. Expand
Speciation as automatic categorical modularization
An evolutionary learning system is presented which follows this second approach to automatically create a repertoire of specialist strategies for a game-playing system that relieves the human effort of deciding how to divide and specialize. Expand
Digraphs - theory, algorithms and applications
Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science, and it will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology. Expand
Ideal Evaluation from Coevolution
It is shown that for any set of learners, a Complete Evaluation Set can be determined that provides ideal evaluation as specified by Evolutionary Multi-Objective Optimization, and thereby brings automatic ideal evaluation within reach. Expand