Networking Strategy: Cooperate Today in Order to Meet a Cooperator Tomorrow

This paper explains why people might cooperate playing an infinitely recurring prisoners' dilemma in which they change their partner in every period. After two people have played the prisoners' dilemma there is a possibility for networking. Then, two cooperators who played against each other exchange information about cooperators that they have met in previous periods. In the next period, they use this information in order to increase their probability of matching with a cooperator. Whether it is payoff maximizing to cooperate, given that all cooperators network, depends on the share of cooperators in the society. People learn their optimal strategy in a learning process which is represented by a payoff monotonic dynamic. The evolutionary analysis shows that there exist two stable states: One state in which a large share of the people in the society cooperate, and another state in which nobody cooperates.