Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives

@article{Mittal2006OptimalSO,
  title={Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives},
  author={Shashi Mittal and Kalyanmoy Deb},
  journal={2006 IEEE Symposium on Computational Intelligence and Games},
  year={2006},
  pages={197-204}
}
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… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS
24 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A fast and elitist multiobjective algorithm : NSGA - II "

  • A. Pratap, S. Agarwal, T. Meyarivan
  • IEEE Transactions on Evolutionary Computation
  • 2002

A fast and elitist multiobjective genetic algorithm : NSGAII

  • A. Pratap, T. Meyarivan
  • IEEE Trans . Evol . Comput .
  • 2002

Similar Papers

Loading similar papers…