List of six prisoner's dilemma strategies (Dal Bo and Frechette 2011).
Each strategy is encoded as a data.frame object. The rows of the data frame represent the states of the automaton. The first row is the start state of the automaton. Each data.frame object contains the following variables:
Probability to defect.
Probability to cooperate.
Probability of a tremble.
State transition for the input cc.
State transition for the input cd.
State transition for the input dc.
State transition for the input dd.
The prisoner's dilemma strategies are:
Strategy which always defects.
Strategy which always cooperates.
Strategy which cooperates until one player defects, then GRIM defects forever.
Strategy which cooperates unless the partner defected in the last round.
Strategy which cooperates if both players chose the same action last round, otherwise WSLS defects.Also known as PTFT.
Strategy which cooperates until either player defects, then it defects twice and returns to cooperation (regardless of the actions during the punishment phase).
Dal Bo P, Frechette GR (2011). "The Evolution of Cooperation in Infinitely Repeated Games: Experimental Evidence." American Economic Review, 101(1), 411-429.
strategies <- strategies.DF2011[c("ALLD","ALLC","TFT","GRIM")]
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.