Collaboration in networks with randomly chosen agents

作者:Cui, ZW (Cui, Zhiwei)^{[ 1 ]} ; Wang, R (Wang, Rui)^{[ 2 ]} 

The present paper considers a finite population of agents located in an arbitrary, fixed network. In each period, a small proportion of agents are randomly chosen to play a minimum effort game. They learn from both their own and their neighbors' experiences and imitate the most successful choices, though they may occasionally make mistakes. We show that in the long run all agents will choose the highest effort level provided that each agent's neighborhood is large. (C) 2016 Elsevier B.V. All rights reserved.