Corpus ID: 15968796

Rules of engagement : competitive coevolutionary dynamics in computational systems

  title={Rules of engagement : competitive coevolutionary dynamics in computational systems},
  author={J. Cartlidge},
Given that evolutionary biologists have considered coevolutionary interactions since the dawn of Darwinism, it is perhaps surprising that coevolution was largely overlooked during the formative years of evolutionary computing. It was not until the early 1990s that Hillis' seminal work thrust coevolution into the spotlight. Upon attempting to evolve fixed-length sorting networks, a problem with a long and competitive history, Hillis found that his standard evolutionary algorithm was producing… 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
The road to everywhere : Evolution, complexity and progress in natural and artificial systems
A rich experimental system, inspired by the seminal work of Karl Sims, is implemented, in which virtual creatures can evolve and interact under various conditions in a physically realistic three-dimensional (3D) environment, and this is the first complete reimplementation and extension of Sims' results. Expand
Co-Evolution Versus Evolution with Random Sampling for Acquiring Othello Position Evaluation
The results of extensive computational experiments prove that guiding coevolutionary search on the basis of games against a sample of random opponents employed by ICL has indeed a great potential when applied to the problem of Othello, and show that it is possible to design a coev evolutionary algorithm of better performance than ICL. Expand
Coordinate System Archive for coevolution
This study proposes a novel coevolutionary archive method, called Coordinate System Archive (COSA), based on a notion of coordinate system, which spatially arranges candidate solutions and tests in a multidimensional space and finds out that COSA is superior to these methods on a class of artificial problems. Expand
Algorithms for Test-Based Problems
Problems in which some elementary entities interact with each other are common in computational intelligence. This scenario, typical for coevolving artificial-life agents, learning strategies forExpand
Why Coevolution Doesn't "Work": Superiority and Progress in Coevolution
By clearly defining and distinguishing between different types of progress, this paper identifies limitations with existing techniques and algorithms, address them, and generally facilitate discussion and understanding of coevolution. Expand
Co-optimization algorithms
This paper finds that the co-optimization versions of gradient ascent and simulated annealing are capable of outperforming the canonical coevolutionary algorithm and hypothesize that techniques which employ non-population based selection mechanisms are less sensitive to disengagement. Expand
Unbiased coevolutionary solution concepts
The primary concern of this paper is the question: Is the goal of an optimal well behaved coevolutionary algorithm attainable? We approach this question from the point of view of the No Free LunchExpand
Online Discovery of Search Objectives for Test-Based Problems
Disco is proposed, a method that automatically identifies the groups of tests for which the candidate solutions behave similarly and defines the above skills, and each such group gives rise to a derived objective, and these objectives together guide the search algorithm in multi-objective fashion. Expand
Modelling the evolution of warning signals and mimicry with individual-based simulations
Simulation results show that warning signals can, in theory, evolve in response to mimicry, and theories of warning signals and mimicry are brought together in a mathematical model that looks at whether animals with a defence might evolve traits that are difficult for undefended animals to exploit. Expand


When Coevolutionary Algorithms Exhibit Evolutionary Dyna mics
The task of understanding the dynamics of coevolutionary algorithms or comparing performance between such algorithms is complicated by the fact the internal fitness measures are subjective. Though aExpand
Coevolutionary dynamics in a minimal substrate
One of the central difficulties of coevolutionary methods arises from 'intransitive superiority' – in a two-player game, for example, the fact that A beats B, and B beats C, does not exclude theExpand
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Given a simple string- matching task, it is shown that evolutionary pressure to increase the overall fitness of the ecosystem can provide the needed stimulus for the emergence of an appropriate number of interdependent subcomponents that cover multiple niches, evolve to an appropriate level of generality, and adapt as the number and roles of their fellowSubcomponents change over time. Expand
Coevolutionary search among adversaries
Competitive coevolution is a biologically-inspired search technique that uses a genetic algorithm in two competing populations. During search, individuals in each population are evaluated by directExpand
A Comparison of Evolutionary and Coevolutionary Search
It is shown that the increased efficacy in the coevolutionary model results from the direct exploitation of low quality strategies by the population of training cases, and there is evidence that the generality of the high-quality strategies can suffer as a result of this same exploitation. Expand
Information integration and red queen dynamics in coevolutionary optimization
  • L. Pagie, P. Hogeweg
  • Computer Science, Biology
  • Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
  • 2000
This work studies coevolutionary optimization of the density classification task in cellular automata in a spatially explicit, two-species model and compares the two processes leading to the different outcomes in terms of the diversity of the two populations at thelevel of the genotype and at the level of the phenotype. Expand
Co-evolutionary design: Implications for evolutionary robotics
It is contested that if co-evolutionary design is to provide systems that solve problems in ways that reveal general purpose design principles, i.e. to provide robust styles of solution, true co-Evolution must be abandoned in favour of diiuse co-evil design regimes. Expand
Coevolution to the edge of chaos: coupled fitness landscapes, poised states, and coevolutionary avalanches.
The results suggest that sustained fitness is optimized when landscape ruggedness relative to couplings between landscapes is tuned such that Nash equilibria just tenuously form across the ecosystem. Expand
Coevolution of a Backgammon Player
The results show co-evolution to be a powerful machine learning method, even when coupled with simple hillclimbing, and suggest that the surprising success of Tesauro’s program had more to do with the co-Evolutionary structure of the learning task and the dynamics of the backgammon game itself, than to sophistication in the learning techniques. 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