Reference : The Parallel Nash Memory for Asymmetric Games
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/11053
The Parallel Nash Memory for Asymmetric Games
English
Oliehoek, Frans A. [> >]
de Jong, Edwin D. [> >]
Vlassis, Nikos mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
2006
Proc. Genetic and Evolutionary Computation Conference, Seattle, WA
337-344
Yes
Proc. Genetic and Evolutionary Computation Conference, Seattle, WA
2006
[en] 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.
http://hdl.handle.net/10993/11053

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
download.pdfAuthor postprint185.93 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.