ACM Home Page
Please provide us with feedback. Feedback
Problem decomposition using indirect reciprocity in evolved populations
Full text PdfPdf (817 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 2: artificial life, evolutionary robotics, adaptive behavior, and evolvable hardware table of contents
Pages 105-112  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Heather J. Goldsby  Michigan State University, East Lansing, MI, USA
Sherri Goings  Michigan State University, East Lansing, MI, USA
Jeff Clune  Michigan State University, East Lansing, MI, USA
Charles Ofria  Michigan State University, East Lansing, MI, USA
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1569917
What is a DOI?

ABSTRACT

Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then assemble the subcomponents to produce an overall solution. Ideally, these techniques would automatically decompose the problem and dynamically assemble the subcomponents to form the solution. However, although significant progress in automated problem decomposition has been made, most techniques explicitly assemble the complete solution as part of the fitness function. In this paper, we propose a digital-evolution technique that lays the groundwork for enabling individuals within the population to dynamically decompose a problem and assemble a solution. Specifically, our approach evolves specialists that produce some subcomponents of a problem, cooperate with others to receive different subcomponents, and then assemble the subcomponents to produce an overall solution. We first establish that this technique is able to evolve specialists that cooperate. We then demonstrate that it is more effective to use a generalist strategy, wherein organisms solve the entire problem themselves, on simple problems, but that a specialist strategy is better on complex problems. Finally, we show that our technique automatically selects a generalist or specialist strategy based on the complexity of the problem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Clune, H. J. Goldsby, C. Ofria, and R. T. Pennock. Digital evolution confirms and informs the inclusive fitness theory prediction that selection favors increasingly accurate altruism targeting mechanisms. In preparation.
 
2
 
3
D. Cornforth and M. Kirley. Cooperative problem solving using an agent-based market. In Genetic and evolutionary computation conference (GECCO), pages 60--71, Seattle, Washington, 2004.
 
4
 
5
S. Goings, J. Clune, C. Ofria, and R. T. Pennock. Kin-selection: The rise and fall of kin-cheaters. In Ninth International Conference on Artificial Life, pages 303--308, Boston, MA, 2004.
 
6
S. Goings and C. Ofria. Ecological approaches to diversity maintenance in evolutionary algorithms. In IEEE Symposium on Artificial Life, Nashville, TN, 2009.
 
7
 
8
R. E. Lenski, C. Ofria, T. C. Collier, and C. Adami. Genome complexity, robustness, and genetic interactions in digital organisms. In Nature, volume 400, pages 661--664, 1999.
 
9
R. E. Lenski, C. Ofria, R. T. Pennock, and C. Adami. The evolutionary origin of complex features. In Nature, volume 423, pages 139--144, 2003.
10
 
11
M. A. Nowak. Five rules for the evolution of cooperation. Science, 314(5805):1560--1563, December 2006.
 
12
C. Ofria and C. Adami. Evolution of genetic organization in digital organisms. In Proc. of DIMACS workshop Evolution as Computation, pages 167--175, Princeton, NJ, 1999.
 
13
C. Ofria, C. Adami, and T. C. Collier. Design of evolvable computer languages. IEEE Transactions in Evolutionary Computation, 6:420--424, 2002.
 
14
 
15
 
16
R. Sugden. The economics of rights, co-operation and welfare. Oxford: Basil Blackwell, 1986.
 
17
R. Sun and D. Qi. Marlbs: Team cooperation through bidding. In International Journal of Computational Intelligence Research, 2005.
 
18
C. O. Wilke, J. L. Wang, C. Ofria, C. Adami, and R. E. Lenski. Evolution of digital organisms at high mutation rate leads to survival of the flattest. In Nature, volume 412, pages 331--333, 2001.
 
19

Collaborative Colleagues:
Heather J. Goldsby: colleagues
Sherri Goings: colleagues
Jeff Clune: colleagues
Charles Ofria: colleagues