The Dynamic Procedure of Information Flow Network
Contributions to game theory and management, Tome 4 (2011), pp. 172-187.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{CGTM_2011_4_a12,
     author = {Hongwei Gao and Zuoyi Liu and Yeming Dai},
     title = {The {Dynamic} {Procedure} of {Information} {Flow} {Network}},
     journal = {Contributions to game theory and management},
     pages = {172--187},
     publisher = {mathdoc},
     volume = {4},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2011_4_a12/}
}
TY  - JOUR
AU  - Hongwei Gao
AU  - Zuoyi Liu
AU  - Yeming Dai
TI  - The Dynamic Procedure of Information Flow Network
JO  - Contributions to game theory and management
PY  - 2011
SP  - 172
EP  - 187
VL  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2011_4_a12/
LA  - en
ID  - CGTM_2011_4_a12
ER  - 
%0 Journal Article
%A Hongwei Gao
%A Zuoyi Liu
%A Yeming Dai
%T The Dynamic Procedure of Information Flow Network
%J Contributions to game theory and management
%D 2011
%P 172-187
%V 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2011_4_a12/
%G en
%F CGTM_2011_4_a12
Hongwei Gao; Zuoyi Liu; Yeming Dai. The Dynamic Procedure of Information Flow Network. Contributions to game theory and management, Tome 4 (2011), pp. 172-187. http://geodesic.mathdoc.fr/item/CGTM_2011_4_a12/

[1] Galeotti A., Goyal S., “The Law of the Few”, American Economic Review, 100:4 (2010), 1468–1492 | DOI | MR

[2] Bala V., Goyal S., “A Noncooperative Model of Network Formation”, Econometrica, 68 (2000), 1181–1229 | DOI | MR | Zbl

[3] Gao H. W., Yang H. J., Wang G. X., et al., “The existence theorem of absolute equilibrium about games on connected graph with state payoff vector”, Science China Math., 53:6 (2010), 1483–1490 | DOI | MR | Zbl

[4] Gao H.,W., Petrosyan L.,A., Dynamics Cooperative Games, Science Press, Beijing, 2009

[5] Hojman D., Szeidl A., “Core and periphery in networks”, Journal of Economic Theory, 139 (2008), 295–309 | DOI | MR | Zbl