Recombinant knowledge and the evolution of innovation networks

被引:40
作者
Koenig, Michael D. [1 ]
Battiston, S. [2 ]
Napoletano, M. [2 ,3 ]
Schweitzer, F. [2 ]
机构
[1] Stanford Univ, Dept Econ, Stanford, CA 94305 USA
[2] Swiss Fed Inst Technol, Dept Management Technol & Econ, CH-8032 Zurich, Switzerland
[3] OFCE & SKEMA Business Sch, F-06560 Valbonne, France
关键词
R&D networks; Knowledge recombination; Network efficiency; Network formation; RESEARCH-AND-DEVELOPMENT; FAMILIARITY BREED TRUST; INTERORGANIZATIONAL COLLABORATION; STRATEGIC MODEL; PATTERNS; GROWTH; INFORMATION; PATENTS; TRENDS; WORLDS;
D O I
10.1016/j.jebo.2011.01.007
中图分类号
F [经济];
学科分类号
02 ;
摘要
We introduce a new model for the evolution of networks of firms exchanging knowledge in R&D partnerships. Innovation is assumed to result from the recombination of knowledge among firms in an R&D intensive industry. The decision of two firms to establish a new partnerships or to terminate an existing one, is based on their marginal revenues and costs, which in turn depend on the position they occupy in the network. Moreover, the formation of a collaboration has significant external effects on the other firms in the same connected component of the network. We show that this decentralized partner selection process leads to the existence of multiple equilibrium structures. Finally, by means of computer simulations, we study the properties of the emerging equilibrium networks and we show that they reproduce the stylized facts of R&D networks. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:145 / 164
页数:20
相关论文
共 72 条
[1]   Collaboration networks, structural holes, and innovation: A longitudinal study [J].
Ahuja, G .
ADMINISTRATIVE SCIENCE QUARTERLY, 2000, 45 (03) :425-455
[2]  
[Anonymous], 1985, Matrix Analysis
[3]  
[Anonymous], 1997, EIGENSPACES GRAPHS E
[4]  
[Anonymous], BEA WORKING PAPERS
[5]  
[Anonymous], 1993, TEXTS APPL MATH
[6]  
[Anonymous], 200764 FOND EN E MAT
[7]  
[Anonymous], 2003, IND INNOV
[8]  
[Anonymous], STRUCTURAL CHANGE EC
[9]  
[Anonymous], 1998, Random graphs
[10]  
[Anonymous], 2007, COMPLEX SOCIAL NETWO