Friendly-rivalry solution to the iterated n-person public-goods game
Fig 2
Schematic diagram of the transition between states of CAPRI-n.
The five rules of the strategy can be identified with the player’s internal states [26], each of which is represented as a node in this diagram. An exception is state I, which corresponds to two nodes to clarify the following point: When t* ≥ t − m, the state may have outgoing connections to A and P. When t* < t − m, on the other hand, the only possible next state is R. The player has to choose c at a blue node and d at a red node. We have omitted error-caused transitions for the sake of simplicity.