主  题：Collaboration in networks with randomly chosen agents
时  间：2014年11月25日 （星期二）12:00-13:30
地  点：后主楼1610
主讲人：崔志伟，北京航空航天大学经济管理学院

内容提要：
The present paper considers a population of finite agents located in arbitrary, fixed network. In each period, a fixed number of agents are randomly chosen to play a minimum effort game. They learn from their neighbors’ experience through imitation of the most successful strategies though occasionally make mistakes. We show that in the long run all agents will choose the highest effort level and socially optimal collaboration will be guaranteed, provided that each agent’s neighborhood is sufficiently large.

主讲人简介：
    崔志伟，北京航空航天大学经济管理学院。崔教授的主要研究领域为博弈论及其应用（博弈学习理论）、社会网络与经济行为理论，其研究成果发表在Journal of Economic Dynamics and Control、Review of Development Economics、Mathematical Social Sciences、Computational Economics、Journal of Mathematical Economics、The B.E. Journal of Theoretical Economics、《运筹与管理》和《中国管理科学》等一系列国内外权威刊物上。