powered by
Matrix representation of the prisoner's dilemma strategy which always plays C
data(ALLC)
A matrix with 1 row and 6 columns:
Each row corresponds to one states of the automaton.
Enumerates the states of the automaton.
Probability to play C given the current state of the automaton.
State transition if the history of play in the last round was CC (input is 1).
State transition if the history of play in the last round was CD (input is 2).
State transition if the history of play in the last round was DC (input is 3).
State transition if the history of play in the last round was DD (input is 4).
# NOT RUN { strategies <- rbind(ALLC,ALLD,TFT,GRIM,PTFT) # }
Run the code above in your browser using DataLab