Optimal strategies of the iterated prisoner's dilemma problem for multiple conflicting objectives

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 3, 2009, Pages 554-565

  Mittal, Shashi ^a   Deb, Kalyanmoy ^b,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HELSINKI SCHOOL OF ECONOMICS   (Finland)

^c INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Evolutionary algorithms; Games; Multiobjective optimization; Prisoner's dilemma

Indexed keywords

GAMES; ITERATED GAMES; ITERATED PRISONER'S DILEMMA; MULTI OBJECTIVE; OPTIMAL STRATEGIES; PRISONER'S DILEMMA;

EVOLUTIONARY ALGORITHMS; GAME THEORY; OPTIMAL SYSTEMS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 67650151028     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.2009459     Document Type: Article

References (28)

1. R. Axelrod, "The evolution of strategies in the iterated prisoner's dilemma," in Proc. Genetic Algorithms Simulated Annealing, Los Altos, CA: Morgan Kaufmann, 1987.
2. D. E. Goldberg, Genetic Algorithms for Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
3. R. Dawkins, The Selfish Gene, 2nd ed. New York: Oxford Univ. Press, 1989.
4. M. Rubenstein and M. Osborne, A Course in Game Theory. Cambridge, MA: MIT Press, 1994.
5. J. F. Nash, "Equilibrium points in n-person games," in Proc. Nat. Academy Sci., vol. 36. 1950, pp. 48-49.
6. D. Fudenberg and E. Maskin, "The folk theorem in repeated games with discounting or incomplete information," Econometrica, vol. 54, no. 3, pp. 533-554, 1986.
7. R. Axelrod and W. Hamilton, "The evolution of cooperation," Sci. vol. 211, no. 4489, pp. 1390-1396, 1981.
8. R. Axelrod, The Evolution of Cooperation. New York: Basic Books, 1989.
9. D. Fogel, "Evolving behaviors in the iterated prisoner's dilemma," Evol. Comput., vol. 1, no. 1, pp. 77-97, 1983.
10. M. Nowak and K. Sigmund, "A strategy of win-stay, lose-shift that outperforms tit-for-tat in the prisoner's dilemma game," Nature, vol. 364, no. 6432, pp. 56-58, 1993.
11. B. Beaufils, J. P. Delahaye, and P. Mathieu, "Our meeting with gradual, a good strategy for the iterated prisoner's dilemma," in Proc. Artificial Life V: Proc. 5th Int. Workshop Synthesis Simulation Living Syst., Cambridge, MA: MIT Press, 1996, pp. 202-209.
12. D. Bragt, C. Kemenade, and H. Poutré, "The influence of evolutionary selection schemes on the iterated prisoner's dilemma," Comput. Econ. vol. 17, no. 2-3, pp. 253-263, 2001.
13. D. Jang, P. Whigham, and G. Dick, "On evolving fixed pattern strategies for iterated prisoner's dilemma," in Proc. 27th Conf. Australasian Comput. Sci., Dunedin, New Zealand, 2004, pp. 241-247.
14. M. R. Frean and E. R. Abraham, "A voter model of the spatial prisoner's dilemma," IEEE Trans. Evol. Comput., vol. 5, no. 2, pp. 117-121, Apr. 2001.
15. H. Ishibuchi and N. Namikawa, "Evolution of iterated prisoner's dilemma game strategies in structured demes under random pairing in game playing," IEEE Trans. Evol. Comput., vol. 9, no. 6, pp. 552-561, Dec. 2005.
16. S. Y. Chong and X. Yao, "Behavioral diversity, choices and noise in the iterated prisoner's dilemma," IEEE Trans. Evol. Comput., vol. 9, no. 6, pp. 540-551, Dec. 2005.
17. K. Deb, P. Jain, N. Gupta, and H. Maji, "Multiobjective placement of electronic components using evolutionary algorithms," IEEE Trans. Components and Packaging Technol., vol. 27, no. 3, pp. 480-492, Sep. 2004.
18. J. D. Knowles, D.W. Corne, and K. Deb, Multiobjective Problem Solving From Nature (Springer Natural Computing Series). New York: Springer-Verlag, 2008.
19. C. A. C. Coello, D. A. Van Veldhuizen, and G. Lamont, Evol. Algorithms for Solving Multiobjective Problems. Boston, MA: Kluwer, 2002.
20. K. Deb and A. Srinivasan, "Innovization: Innovating design principles through optimization." in Proc. Genetic Evol. Comput. Conf. (GECCO-2006), New York: The Association of Computing Machinery (ACM), 2006, pp. 1629-1636.
21. J. Branke, "Creating robust solutions by means of an evolutionary algorithm," in Proc. Parallel Problem Solving Nature (PPSN-V , 1998, pp. 119-128.
22. K. Deb and H. Gupta, "Introducing robustness in multiobjective optimization," Evol. Comput. J., vol. 14, no. 4, pp. 463-494, 2006.
23. P. J. Darwen and X. Yao, "Co-evolution in iterated prisoner's dilemma with intermediate levels of cooperation: Application to missile defense." Int. J. Comput. Intell. Applicat., vol. 2, no. 1, pp. 83-107, 2002.
24. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
25. K. Deb, Multiobjective Optimization Using Evolutionary Algorithms. Chichester, U.K.: Wiley, 2001.
26. D. E. Goldberg and J. Richardson, "Genetic algorithms with sharing for multimodal function optimization," in Proc. 1st Int. Conf. Genetic Algorithms Their Applicat., 1987, pp. 41-49.
27. K. Deb, "Genetic algorithms in multi-modal function optimization," M.S. thesis, Department of Engineering Mechanics, University of Alabama, Tuscaloosa, AL, 1989.
28. K. Deb and D. E. Goldberg, "An investigation of niche and species formation in genetic function optimization," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 42-50.