|
Contributions to Game Theory and Management, 2011, Volume 4, Pages 172–187
(Mi cgtm186)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
The Dynamic Procedure of Information Flow Network
Hongwei Gaoa, Zuoyi Liub, Yeming Daia a Qingdao University, College of Mathematics, 308 Ningxia Road, Qingdao, P.R.CHINA, 266071
b Department of Management Sciences, National Natural Science Foundation of China(NSFC), 83 Shuangqing Road, Haidian District, Beijing, P.R.CHINA, 100085
Abstract:
The characterization of the architecture of information flow equilibrium networks and the dynamics of network formation are studied under the premise of local information flow. The main result of this article is that it gives the dynamic formation random procedure in the local information flow network. The research shows that core-periphery structure is the most representative equilibrium network in the case of the local information flow without information decay whatever the cost of information is homogeneous or heterogeneous and it obtains the theory of equilibrium network architecture on two kinds of typical core-periphery architecture networks. If profits and link costs are homogeneous under the premise of local information flow and with the presence of decay beside empty network complete network is typical equilibrium network when the cost of linking is small enough and they are tried to prove theoretically.
Keywords:
local information flow, information decay, random dynamic procedure, core-periphery architecture, equilibrium network.
Citation:
Hongwei Gao, Zuoyi Liu, Yeming Dai, “The Dynamic Procedure of Information Flow Network”, Contributions to Game Theory and Management, 4 (2011), 172–187
Linking options:
https://www.mathnet.ru/eng/cgtm186 https://www.mathnet.ru/eng/cgtm/v4/p172
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 62 | References: | 32 |
|