Efficiency of network structures: The needle in the haystack
The modelling of networks formation has recently became the object of an increasing interest in economics. One of the important issues raised in this literature is the one of networks efficiency. Nevertheless, for non trivial payoff functions, searching for efficient network structures turns out to be a very difficult analytical problem as well as a huge computational task, even for a relatively small number of agents. In this paper, we explore the possibility of using genetic algorithms (GA) techniques for identifying efficient network structures, because the GA have proved their power as a tool for solving complex optimization problems. The robustness of this method in predicting optimal network structures is tested on two simple stylized models introduced by Jackson and Wolinski (1996), for which the efficient networks are known over the whole state space of parameter values.
|Date of creation:||2005|
|Date of revision:|
|Contact details of provider:|| Web page: http://gres.u-bordeaux4.fr/|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:grs:wpegrs:2005-06. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Vincent Frigant)
If references are entirely missing, you can add them using this form.