Co-evolving parasites improve simulated evolution as an optimization procedure
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Artificial Life
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Coevolutionary search among adversaries
Coevolutionary search among adversaries
Co-Evolution in the Successful Learning of Backgammon Strategy
Machine Learning
Coevolving communicative behavior in a linear pursuer-evadergame
Proceedings of the fifth international conference on simulation of adaptive behavior on From animals to animats 5
Competitive co-evolutionary robotics: from theory to practice
Proceedings of the fifth international conference on simulation of adaptive behavior on From animals to animats 5
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Tracking the Red Queen: Measurements of Adaptive Progress in Co-Evolutionary Simulations
Proceedings of the Third European Conference on Advances in Artificial Life
Coevolutionary Learning: A Case Study
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Evolution of complexity in real-world domains
Evolution of complexity in real-world domains
An analysis of cooperative coevolutionary algorithms
An analysis of cooperative coevolutionary algorithms
Solution concepts in coevolutionary algorithms
Solution concepts in coevolutionary algorithms
The MaxSolve algorithm for coevolution
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Monotonic solution concepts in coevolution
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On identifying global optima in cooperative coevolution
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Evolutionary Computation
Ideal Evaluation from Coevolution
Evolutionary Computation
Evolutionary consequences of coevolving targets
Evolutionary Computation
A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence
A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence
Competitive coevolution through evolutionary complexification
Journal of Artificial Intelligence Research
A game-theoretic memory mechanism for coevolution
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Theory of coevolutionary genetic algorithms
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
A no-free-lunch framework for coevolution
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Unbiased coevolutionary solution concepts
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Co-evolution of cooperative strategies under egoism
Proceedings of the 12th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function, but may also be unstable and thereby prevent reliable progress. Recent work in coevolution has therefore focused on algorithms that guarantee progress with respect to a given solution concept. The Nash Memory archive guarantees monotonicity with respect to the game-theoretic solution concept of the Nash equilibrium, but is limited to symmetric games. We present an extension of the Nash Memory that guarantees monotonicity for asymmetric games. The Parallel Nash Memory is demonstrated in experiments, and its performance on general sum games is discussed.