ACM Home Page
Please provide us with feedback. Feedback
Cheating for problem solving: a genetic algorithm with social interactions
Full text PdfPdf (493 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 9: genetic algorithms table of contents
Pages 811-818  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Rafael Lahoz-Beltra  Complutense University of Madrid, Madrid, Spain
Gabriela Ochoa  University of Nottingham, Nottingham, United Kingdom
Uwe Aickelin  University of Nottingham, Nottingham, United Kingdom
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): n/a,   Downloads (12 Months): n/a,   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.1570013
What is a DOI?

ABSTRACT

We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary role of social systems and its possible application as a non-genetic new step in evolutionary algorithms. In biological populations, i.e. animals, even human beings and microorganisms, social interactions often affect the fitness of individuals. It is conceivable that the perturbation of the fitness via social interactions is an evolutionary strategy to avoid trapping into local optimum, thus avoiding a fast convergence of the population. We model the social interactions according to Game Theory. The population is, therefore, composed by cooperator and defector individuals whose interactions produce payoffs according to well known game models (prisoner's dilemma, chicken game, and others). Our results on Knapsack problems show, for some game models, a significant performance improvement as compared to a standard genetic algorithm.


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
Grushin, A. The effects of static fitness function noise upon the performance of genetic algorithms. In Proceedings of the 7th Joint Conference on Information Sciences (JCIS'06) (Kaohsiung, Taiwan, ROC, 2006). Cheng, H. D., Chen, S. D., Lin, R. Y. Atlantis Press, 275--278.
 
2
Hillis, W. D. Co-evolving parasites improve simulated evolution as an optimization procedure, Artificial Life II, SFI Studies in the Science of Complexity, vol. X, edited by C. G. Langton, C. Taylor, J. D. Farmer and S. Rasmussen, Addison-Wesley, pp. 313--324, 1991.
 
3
 
4
 
5
Vasquez, M., Hao, J.-K.: A hybrid approach for the 0-1 multidimensional knapsackproblem. In Proceedings of the International Joint Conference on Artificial Intelligence 2001, pp. 328--333 (2001).
 
6
Wolf, J., Brodie, E. D., Moore, A. J. Interacting phenotypes and the evolutionary process. II. Selection resulting from social interactions. The American Naturalist 153, 3 (March 1999), 254--266.
 
7
 
8
Travisano, M., Velicer, G. J. Strategies of microbial cheater control. TRENDS in Microbiology 12, 2 (February 2004), 72--78.
 
9
Lenski, R. E., and Velicer, G. J. Games microbes play. Selection 1, 1-3 (2000), 89--95.
 
10
Velicer, G. J. Social strife in the microbial world. TRENDS in Microbiology 11, 7 (July 2003), 330--337.
 
11
Turner, P. E. A virus booster for game theory. ASM News 69, 6 (2003), 289--295.
 
12
Turner, P. E. Cheating viruses and game theory. American Scientist 93, (2005), 428--435.
 
13
Turner, P. E., Chao, L. Escape from Prisoner's dilemma in RNA phage 6. The American Naturalist 161, 3 (March 2003), 497--505.
 
14
Zitzler, E., Laumanns, M. (2008). Swiss Federal Institute of Technology Zurich. Systems Optimization. Test Problem Suite. http://www.tik.ee.ethz.ch/sop/download/supplementary/testProblemSuite/
 
15
Beasley, J. E. (1990). OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069--1072. Also available at http://www.ms.ic.ac.uk/ info.html.
 
16
Nowak, M. A. Five rules for the evolution of cooperation. Science 314, 5805 (December 2006), 1560--1563.
 
17
Perc, M. Chaos promotes cooperation in the spatial prisoner's dilemma game. Europhysical Letters 75, 6 (September 2006), 841--846.
 
18
Hamilton, W. D. The Genetical Evolution of Social Behavior. Journal of Theoretical Biology 7, 1 (1964), 1--52.
 
19
Axelrod, R. The Evolution of Cooperation. Basic Books, New York, 1984.

Collaborative Colleagues:
Rafael Lahoz-Beltra: colleagues
Gabriela Ochoa: colleagues
Uwe Aickelin: colleagues