• Corpus ID: 119022340

Solution concepts in coevolutionary algorithms

@inproceedings{Pollack2004SolutionCI,
  title={Solution concepts in coevolutionary algorithms},
  author={Jordan B. Pollack and Sevan G. Ficici},
  year={2004}
}
Inspired by the principle of natural selection, coevolutionary algorithms are search methods in which processes of mutual adaptation occur amongst agents that interact strategically. The outcomes of interaction reveal a reward structure that guides evolution towards the discovery of increasingly adaptive behaviors. Thus, coevolutionary algorithms are often used to search for optimal agent behaviors in domains of strategic interaction. Coevolutionary algorithms require little a priori knowledge… 
Coevolutionary algorithms for the optimization of strategies for red teaming applications
TLDR
It is suggested that children under the age of five should be supervised by an adult rather than a stranger, as is the case with children aged five and under.
Solution Concepts for the Simulation of Household-Level Joint Decision Making in Multi-Agent Travel Simulation Tools
In the recent years, there have been a growing interest in understanding and forecasting joint travel-related decisions, that is, decisions taken by several individuals together, including binding
Coevolutionary Principles
TLDR
This chapter outlines the ends and means of coevolutionary algorithms: what they are meant to find, and how they should find it.
Learning board evaluation function for Othello by hybridizing coevolution with temporal difference learning
TLDR
This paper presents Coevolutionary Temporal Difference Learning (CTDL), a fusion of various forms of coevolution with a gradient-based local search that works by interlacing global search provided by competitive coevolved and local search by means of temporal difference learning.
A methodical framework for engineering co-evolution for simulating socio-economic game playing agents
TLDR
It is shown that convergence to the equilibrium solutions can be achieved with boundedly rational agents by working on the elements of the implemented co-evolutionary solution concept, as opposed to previous studies where bounded rationality was seen as the cause for deviations from equilibrium.
Approximating n-player behavioural strategy nash equilibria using coevolution
TLDR
A coevolutionary algorithm that approximates behavioural strategy Nash equilibria in n-player zero sum games, by exploiting the min-max solution concept is proposed.
Co-evolution of Optimal Agents for the Alternating Offers Bargaining Game
TLDR
It is shown that the conclusion that it is not possible to achieve optimal agents at the end of the co-evolutionary process due to the myopic properties of the evolutionary agents is mis-leading and an algorithm is presented that evolves optimal strategies for the bargaining game with one round.
Monotonicity versus performance in co-optimization
TLDR
This analysis points out that even the weakest monotonicity may simply not be within reach for some solution concepts that are nonetheless of practical interest, and hypothesis put forward, in light of recent ``free lunch'' results, is that the authors may be faced with a difficult choice betweenmonotonicity and performance.
A no-free-lunch framework for coevolution
TLDR
A novel framework for analyzing No-Free-Lunch like results for classes of coevolutionary algorithms based upon the solution concept which they implement and a new instance of free lunches in coevolved which demonstrates the applicability of the framework.
...
...

References

SHOWING 1-10 OF 205 REFERENCES
The Dominance Tournament Method of Monitoring Progress in Coevolution
TLDR
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.
New Methods for Competitive Coevolution
TLDR
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.
Coevolutionary search among adversaries
TLDR
New methods are described that overcome these Aaws and make coevolution more efficient, able to solve several game learning test problems that cannot be efficiently solved without them.
Coevolutionary Learning and the Design of Complex Systems
TLDR
A new strategy based on the concept of an "ideal" trainer to address some of the problems of complex system designs and results in a significant improvement over previously known best rules for this task.
Evolution and the Theory of Games
In the Hamadryas baboon, males are substantially larger than females. A troop of baboons is subdivided into a number of ‘one-male groups’, consisting of one adult male and one or more females with
Genetic Algorithms in Search
Co-evolving parasites improve simulated evolution as an optimization procedure
Diffuse versus true coevolution in a physics-based world
We compare two types of coevolutionary tournaments, true and diffuse, in contests using a general-purpose, physics-based simulator. Previous work in coevolving agents has used true coevolution and
The Theory of Learning in Games
Reducing Bias and Inefficienry in the Selection Algorithm
A sheet which is a blend of water-insoluble fibers and pieces of film of a dry material which converts to a gel quickly on contact with a large amount of water. The blend is formed by suspending the
...
...