Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Properties of winning Iterated Prisoner's Dilemma strategies.

Glynatsi, Nikoleta E, Knight, Vincent ORCID: https://orcid.org/0000-0002-4245-0638 and Harper, Marc 2024. Properties of winning Iterated Prisoner's Dilemma strategies. PLoS Computational Biology 20 (12) , e1012644. 10.1371/journal.pcbi.1012644

[thumbnail of 10.1371/journal.pcbi.1012644.pdf] PDF - Published Version
Download (0B)

Abstract

Researchers have explored the performance of Iterated Prisoner's Dilemma strategies for decades, from the celebrated performance of Tit for Tat to the introduction of the zero-determinant strategies and the use of sophisticated learning structures such as neural networks. Many new strategies have been introduced and tested in a variety of tournaments and population dynamics. Typical results in the literature, however, rely on performance against a small number of somewhat arbitrarily selected strategies, casting doubt on the generalizability of conclusions. In this work, we analyze a large collection of 195 strategies in thousands of computer tournaments, present the top performing strategies across multiple tournament types, and distill their salient features. The results show that there is not yet a single strategy that performs well in diverse Iterated Prisoner's Dilemma scenarios, nevertheless there are several properties that heavily influence the best performing strategies. This refines the properties described by Axelrod in light of recent and more diverse opponent populations to: be nice, be provocable and generous, be a little envious, be clever, and adapt to the environment. More precisely, we find that strategies perform best when their probability of cooperation matches the total tournament population's aggregate cooperation probabilities. The features of high performing strategies help cast some light on why strategies such as Tit For Tat performed historically well in tournaments and why zero-determinant strategies typically do not fare well in tournament settings.

Item Type: Article
Date Type: Published Online
Status: Published
Schools: Mathematics
Additional Information: License information from Publisher: LICENSE 1: Title: cc by, Type: cc by
Publisher: Public Library of Science
ISSN: 1553-734X
Date of First Compliant Deposit: 6 January 2025
Date of Acceptance: 17 November 2024
Last Modified: 06 Jan 2025 15:15
URI: https://orca.cardiff.ac.uk/id/eprint/175038

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics