报告题目：Collaboration in networks with randomly chosen agents

报告人：崔志伟，北京航空航天大学

报告时间：2019年2月27日 16:00-17:00

报告地点：知新楼B1032

报告摘要：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.

邀请人：徐进