Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives
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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/54742 |
| _version_ | 1826208989472358400 |
|---|---|
| author | Deb, Kalyanmoy Mittal, Shashi |
| author2 | Massachusetts Institute of Technology. Operations Research Center |
| author_facet | Massachusetts Institute of Technology. Operations Research Center Deb, Kalyanmoy Mittal, Shashi |
| author_sort | Deb, Kalyanmoy |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T14:15:55Z |
| format | Article |
| id | mit-1721.1/54742 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:15:55Z |
| publishDate | 2010 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/547422022-09-28T19:35:30Z Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives Deb, Kalyanmoy Mittal, Shashi Massachusetts Institute of Technology. Operations Research Center Mittal, Shashi Mittal, Shashi prisoner's dilemma multiobjective optimization games Evolutionary algorithms 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. 2010-05-10T21:06:33Z 2010-05-10T21:06:33Z 2009-06 2007-02 Article http://purl.org/eprint/type/JournalArticle 1089-778X INSPEC Accession Number: 10730191 http://hdl.handle.net/1721.1/54742 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. en_US http://dx.doi.org/10.1109/tevc.2008.2009459 IEEE Transactions on Evolutionary Computation 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. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | prisoner's dilemma multiobjective optimization games Evolutionary algorithms Deb, Kalyanmoy Mittal, Shashi Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title | Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title_full | Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title_fullStr | Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title_full_unstemmed | Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title_short | Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives |
| title_sort | optimal strategies of the iterated prisoner s dilemma problem for multiple conflicting objectives |
| topic | prisoner's dilemma multiobjective optimization games Evolutionary algorithms |
| url | http://hdl.handle.net/1721.1/54742 |
| work_keys_str_mv | AT debkalyanmoy optimalstrategiesoftheiteratedprisonersdilemmaproblemformultipleconflictingobjectives AT mittalshashi optimalstrategiesoftheiteratedprisonersdilemmaproblemformultipleconflictingobjectives |