From extortion to generosity, the evolution of zero-determinant strategies in the prisoner's dilemma
Alexander J. Stewart, Joshua B. Plotkin

TL;DR
This paper investigates the evolution of zero-determinant strategies in the Iterated Prisoner's Dilemma, revealing that generous ZD strategies promote cooperation and outperform extortionate strategies in evolving populations.
Contribution
It introduces and analyzes generous ZD strategies, demonstrating their robustness and dominance over extortionate strategies in evolutionary settings.
Findings
Generous ZD strategies dominate in populations larger than small sizes.
They can replace non-cooperative ZD strategies effectively.
Generous strategies outperform well-known IPD strategies like win-stay-lose-shift.
Abstract
Recent work has revealed a new class of "zero-determinant" (ZD) strategies for iterated, two-player games. ZD strategies allow a player to unilaterally enforce a linear relationship between her score and her opponent's score, and thus achieve an unusual degree of control over both players' long-term payoffs. Although originally conceived in the context of classical, two-player game theory, ZD strategies also have consequences in evolving populations of players. Here we explore the evolutionary prospects for ZD strategies in the Iterated Prisoner's Dilemma (IPD). Several recent studies have focused on the evolution of "extortion strategies" - a subset of zero-determinant strategies - and found them to be unsuccessful in populations. Nevertheless, we identify a different subset of ZD strategies, called "generous ZD strategies", that forgive defecting opponents, but nonetheless dominate in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
