A new framework for analysis of coevolutionary systems - directed graph representation and random walks

Chong, SY, Tiňo, P, He, J ORCID: https://orcid.org/0000-0002-5616-4691 and Yao, X, 2017. A new framework for analysis of coevolutionary systems - directed graph representation and random walks. Evolutionary Computation. ISSN 1063-6560

Preview

Text 10737_He.pdf - Post-print Download (673kB) | Preview

Abstract

Studying coevolutionary systems in the context of simplified models (i.e. games with pairwise interactions between coevolving solutions modelled as self plays) re-mains 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 problem that fully captures structures in the relations between candidate solutions. Coevolutionary processes are modelled as a specific type of Markov chains – random walks on digraphs. Using this framework, we show that coevolu-tionary 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 provide 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.

Item Type:	Journal article
Publication Title:	Evolutionary Computation
Creators:	Chong, S.Y., Tiňo, P., He, J. and Yao, X.
Date:	20 November 2017
ISSN:	1063-6560
Identifiers:	Number Type 10.1162/evco_a_00218 DOI
Divisions:	Schools > School of Science and Technology
Record created by:	Jonathan Gallacher
Date Added:	09 Apr 2018 15:29
Last Modified:	09 Apr 2018 15:29
URI:	https://irep.ntu.ac.uk/id/eprint/33232

Actions (login required)

Edit View

Statistics

Views

Downloads