IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00160962.html
   My bibliography  Save this paper

Efficiency of Network Structures: The Needle in the Haystack

Author

Listed:
  • Murat Yildizoglu

    (GREThA - Groupe de Recherche en Economie Théorique et Appliquée - UB - Université de Bordeaux - CNRS - Centre National de la Recherche Scientifique)

  • Nicolas Carayol

    (GREThA - Groupe de Recherche en Economie Théorique et Appliquée - UB - Université de Bordeaux - CNRS - Centre National de la Recherche Scientifique)

  • Pascale Roux

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.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(Th
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Murat Yildizoglu & Nicolas Carayol & Pascale Roux, 2005. "Efficiency of Network Structures: The Needle in the Haystack," Post-Print hal-00160962, HAL.
    • Handle: RePEc:hal:journl:hal-00160962
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Moebert, Jochen, 2006. "Jefficiency vs. efficiency in social network models," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 25376, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Carayol, Nicolas & Roux, Pascale & YIldIzoGlu, Murat, 2008. "Inefficiencies in a model of spatial networks formation with positive externalities," Journal of Economic Behavior & Organization, Elsevier, vol. 67(2), pages 495-511, August.
    3. Möbert, Jochen, 2006. "Jefficiency vs. Efficiency in Social Network Models," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36779, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Moebert, Jochen, 2006. "Jefficiency vs. efficiency in social network models," Darmstadt Discussion Papers in Economics 161, Darmstadt University of Technology, Department of Law and Economics.

    More about this item

    Keywords

    Structure; Efficiency; network;
    All these keywords.

    JEL classification:

    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00160962. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.