In search of efficient network structures: the needle in the haystack |
| |
Authors: | Nicolas Carayol Pascale Roux Murat Y?ld?zo?lu |
| |
Institution: | (1) A102, Faculté Jean Monnet, 54 Bvd Desgranges, 92331 Sceaux, France;(2) ADIS, Faculté Jean Monnet, Université Paris Sud, 54 Boulevard Desgranges, 92331 Sceaw, France;(3) BETA (UMR CNRS 7522), Université Louis Pasteur, 61 avenue de la Forêt Noire, 67085 Strasbourg, France;(4) GREThA (UMR CNRS 5113), Université Montesquieu Bordeaux IV, Bordeaux, France |
| |
Abstract: | Searching for efficient networks can prove a very difficult analytical and even computational task. In this paper, we explore
the possibility of using the genetic algorithms (GA) technique to identify efficient network structures in the case of non-trivial
payoff functions. The robustness of this method in predicting optimal networks is tested on the two simple stylized models
introduced by Jackson and Wolinsky (1996), for which the efficient networks are known over the whole state space of the parameters’
values. This approach allows us to obtain new exploratory results in the case of the linear-spatialized connections model
proposed by Johnson and Gilles (Rev Econ Des 5:273–299, 2000), for which the efficient allocation of bilateral connections
is driven by contradictory forces that push either for a centralized structure around a coordinating agent, or for only locally
and evenly distributed connections.
Murat Yıldızoğlu gratefully acknowledges the support of the CCRDT program of Aquitaine Region. |
| |
Keywords: | Networks Efficiency Genetic Algorithms |
本文献已被 SpringerLink 等数据库收录! |
|