strategies.DF2011 {stratEst}

strategies.DF2011

Description

List of six prisoner's dilemma strategies (Dal Bo and Frechette 2011).

Usage

data(strategies.DF2011)

Format

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:

prob.d

Probability to defect.

prob.c

Probability to cooperate.

tremble

Probability of a tremble.

tr(cc)

State transition for the input cc.

tr(cd)

State transition for the input cd.

tr(dc)

State transition for the input dc.

tr(dd)

State transition for the input dd.

Details

The prisoner's dilemma strategies are:

ALLD

Strategy which always defects.

ALLC

Strategy which always cooperates.

GRIM

Strategy which cooperates until one player defects, then GRIM defects forever.

TFT

Strategy which cooperates unless the partner defected in the last round.

WSLS

Strategy which cooperates if both players chose the same action last round, otherwise WSLS defects.Also known as PTFT.

T2

Strategy which cooperates until either player defects, then it defects twice and returns to cooperation (regardless of the actions during the punishment phase).

References

Dal Bo P, Frechette GR (2011). "The Evolution of Cooperation in Infinitely Repeated Games: Experimental Evidence." American Economic Review, 101(1), 411-429.

Examples

strategies <- strategies.DF2011[c("ALLD","ALLC","TFT","GRIM")]