Evolution of Cooperative Problem Solving in an Artificial Economy

Created by W.Langdon from gp-bibliography.bib Revision:1.8290

@Article{baum:2000:NeurComp,

• author = "Eric B. Baum and Igor Durdanovic",
• title = "Evolution of Cooperative Problem Solving in an Artificial Economy",
• journal = "Neural Computation",
• year = "2000",
• volume = "12",
• number = "12",
• pages = "2743--2775",
• month = dec,
• keywords = "genetic algorithms, genetic programming, STGP",
• ISSN = "0899-7667",
• URL = "https://www.eecs.harvard.edu/cs286r/courses/spring06/papers/baum_nc00.pdf",
• DOI = "doi:10.1162/089976600300014700",
• eprint = "https://direct.mit.edu/neco/article-pdf/12/12/2743/814655/089976600300014700.pdf",
• size = "33 pages",
• abstract = "We address the problem of how to reinforce learning in ultracomplex environments, with huge state-spaces, where one must learn to exploit a compact structure of the problem domain. The approach we propose is to simulate the evolution of an artificial economy of computer programs. The economy is constructed based on two simple principles so as to assign credit to the individual programs for collaborating on problem solutions. We find empirically that starting from programs that are random computer code, we can develop systems that solve hard problems. In particular, our economy learned to solve almost all random Blocks World problems with goal stacks that are 200 blocks high. Competing methods solve such problems only up to goal stacks of at most 8 blocks. Our economy has also learned to unscramble about half a randomly scrambled Rubik's cube and to solve several commercially sold puzzles.",
• notes = "PMID: 11112253",

}

Genetic Programming entries for Eric B Baum Igor B Durdanovic

Citations