Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Synthesis of strategies from interaction traces
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A strategy with novel evolutionary features for the iterated prisoner's dilemma
Evolutionary Computation
Maintaining cooperation in noisy environments
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Neural networks and Markov models for the iterated prisoner's dilemma
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Cooperative user-network interactions in next generation communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In 1984, Robert Axelrod published a book, relating the story of two competitions which he ran, where invited academics entered strategies for the Iterated Prisoners Dilemma. The book, almost 20 years on, is still widely read and cited by academics and the general public. As a celebration of that landmark work, we have recreated those competitions to celebrate its 20th anniversary, by again inviting academics to submit prisoners dilemma strategies. The first of these new competitions was run in July 2004, and the second in April 2005. Iterated Prisoners Dilemma: 20 Years On essentially provides an update of the Axelrod s book.