![]() |
CiteULike | ![]() |
jonana's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selectionedited by: Lee Spector, Erik D. Goodman, Annie Wu, W. B. Langdon, Hans M. Voigt, Mitsuo Gen, Sandip Sen, Marco Dorigo, Shahram Pezeshk, Max H. Garzon, Edmund BurkeIn Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (July-November 2001), pp. 493-500.
|
Reviews
[Write a review of this article]
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWhen using an automatic discovery method to find a good strategy in a game, we hope to find one that performs well against a wide variety of opponents. An appealing notion in the use of evolutionary algorithms to coevolve strategies is that the population represents a set of dierent strategies against which a player must do well. Implicit here is the idea that dierent players represent dierent \dimensions" of the domain, and being a robust player means being good in many (preferably ...
BibTeX record
RIS record