Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives
Name
Mittal-2009-Optimal Strategies o.pdf
Size
445.6 KB
Format
Adobe PDF
Checksum (MD5)
55dcd35cc78347b6a821a888225a3c04
Author(s)
Deb, Kalyanmoy
Mittal, Shashi
Date Issued
June 2009
Journal
IEEE Transactions on Evolutionary Computation
Publisher
Institute of Electrical and Electronics Engineers
Citation
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.
Version
Final published version
Abstract
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.
Subjects
prisoner's dilemma
multiobjective optimization
games
Evolutionary algorithms
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/tevc.2008.2009459
