A New Framework for Analysis of Coevolutionary Systems—Directed Graph Representation and Random Walks
- 1 June 2019
- journal article
- research article
- Published by MIT Press in Evolutionary Computation
- Vol. 27 (2) , 195-228
Abstract
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 structures and their effects on coevolutionary search. We develop a new framework to address this issue. At the core of our approach is the directed graph (digraph) representation of coevolutionary problems that fully captures structures in the relations between candidate solutions. Coevolutionary processes are modeled as a specific type of Markov chains—random walks on digraphs. Using this framework, we show that coevolutionary problems admit a qualitative characterization: a coevolutionary problem is either solvable (there is a subset of solutions that dominates the remaining candidate solutions) or not. This has an implication on coevolutionary search. We further develop our framework that provides the means to construct quantitative tools for analysis of coevolutionary processes and demonstrate their applications through case studies. We show that coevolution of solvable problems corresponds to an absorbing Markov chain for which we can compute the expected hitting time of the absorbing class. Otherwise, coevolution will cycle indefinitely and the quantity of interest will be the limiting invariant distribution of the Markov chain. We also provide an index for characterizing complexity in coevolutionary problems and show how they can be generated in a controlled manner.Keywords
This publication has 24 references indexed in Scilit:
- A Monotonic Archive for Pareto-CoevolutionEvolutionary Computation, 2007
- Coevolution Versus Self-Play Temporal Difference Learning for Acquiring Position Evaluation in Small-Board GoIEEE Transactions on Evolutionary Computation, 2005
- A Game-Theoretic and Dynamical-Systems Analysis of Selection Methods in CoevolutionIEEE Transactions on Evolutionary Computation, 2005
- Combating Coevolutionary Disengagement by Reducing Parasite VirulenceEvolutionary Computation, 2004
- Ideal Evaluation from CoevolutionEvolutionary Computation, 2004
- Towards an analytic framework for analysing the computation time of evolutionary algorithmsArtificial Intelligence, 2003
- Speciation as automatic categorical modularizationIEEE Transactions on Evolutionary Computation, 1997
- A classification of locally semicomplete digraphsDiscrete Mathematics, 1997
- Co-evolving parasites improve simulated evolution as an optimization procedurePhysica D: Nonlinear Phenomena, 1990
- An extension of Landau’s theorem on tournamentsPacific Journal of Mathematics, 1963