## Publications• Sorted by Date • Classified by Publication Type • Classified by Research Category • ## The Parallel Nash Memory for Asymmetric Games Frans A. Oliehoek, Edwin D. de Jong, and Nikos Vlassis. The Parallel Nash Memory for Asymmetric Games. In ## Downloadpdf [174.6kB] ps.gz [172.6kB] ps HTML ## AbstractCoevolutionary 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. ## BibTeX Entry@InProceedings{Oliehoek06GECCO, author = {Frans A. Oliehoek and Edwin D. de Jong and Nikos Vlassis}, title = {The Parallel {N}ash Memory for Asymmetric Games}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)}, month = jul, year = 2006, pages = {337--344}, note = {\textbf{Best paper nominee in coevolution track}}, doi = {10.1145/1143997.1144059}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p337.pdf}, abstract = { 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.} } Generated by bib2html.pl (written by Patrick Riley) on Mon Oct 07, 2024 14:17:04 UTC |