In search of efficient network structures: the needle in the haystack

Nicolas Carayol, Pascale Roux and Murat Yildizoglu

Post-Print from HAL

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.

Keywords: Networks; Efficiency; Genetic Algorithms (search for similar items in EconPapers)
Date: 2008-02
References: Add references at CitEc
Citations:

Published in Review of Economic Design, 2008, 11, pp.339-359. ⟨10.1007/s10058-007-0036-1⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: In search of efficient network structures: the needle in the haystack (2008)
Working Paper: In search of efficient network structures: The needle in the haystack (2007)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00279311

DOI: 10.1007/s10058-007-0036-1

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().