Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives
Author(s)Deb, Kalyanmoy; Mittal, Shashi
MetadataShow full item record
In this paper, we present a new paradigm of searching optimal strategies in the game of iterated prisoner's dilemma (IPD) using multiple-objective evolutionary algorithms. This method is more useful than the existing approaches, because it not only produces strategies that perform better in the iterated game but also finds a family of nondominated strategies, which can be analyzed to decipher properties a strategy should have to win the game in a more satisfactory manner. We present the results obtained by this new method and discuss sub-strategies found to be common among nondominated strategies. The multiobjective treatment of the IPD problem demonstrated here can be applied to other similar game-playing tasks.
DepartmentMassachusetts Institute of Technology. Operations Research Center
IEEE Transactions on Evolutionary Computation
Institute of Electrical and Electronics Engineers
Mittal, S., and K. Deb. “Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives.” Evolutionary Computation, IEEE Transactions on 13.3 (2009): 554-565. © 2009 Institute of Electrical and Electronics Engineers.
Final published version
INSPEC Accession Number: 10730191
prisoner's dilemma, multiobjective optimization, games, Evolutionary algorithms