Paper published in a book (Scientific congresses, symposiums and conference proceedings)
The Parallel Nash Memory for Asymmetric Games
Oliehoek, Frans A.; de Jong, Edwin D.; VLASSIS, Nikos
2006In Proc. Genetic and Evolutionary Computation Conference, Seattle, WA
Peer reviewed
 

Files


Full Text
download.pdf
Author postprint (190.39 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Abstract :
[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.
Disciplines :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2011-712
Author, co-author :
Oliehoek, Frans A.
de Jong, Edwin D.
VLASSIS, Nikos ;  University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB)
Language :
English
Title :
The Parallel Nash Memory for Asymmetric Games
Publication date :
2006
Event name :
Proc. Genetic and Evolutionary Computation Conference, Seattle, WA
Event date :
2006
Main work title :
Proc. Genetic and Evolutionary Computation Conference, Seattle, WA
Pages :
337-344
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 17 November 2013

Statistics


Number of views
67 (0 by Unilu)
Number of downloads
279 (0 by Unilu)

Scopus citations®
 
13
Scopus citations®
without self-citations
8

Bibliography


Similar publications



Contact ORBilu