IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v12y2008i1p1-19.html
   My bibliography  Save this article

Good neighbors are hard to find: computational complexity of network formation

Author

Listed:
  • Richard Baron
  • Jacques Durieu
  • Hans Haller

    ()

  • Rahul Savani
  • Philippe Solal

Abstract

No abstract is available for this item.

Suggested Citation

  • Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
  • Handle: RePEc:spr:reecde:v:12:y:2008:i:1:p:1-19
    DOI: 10.1007/s10058-008-0043-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10058-008-0043-x
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    2. Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
    3. Markus Mobius & Raphael Schoenle, 2006. "The Evolution of Work," NBER Working Papers 12694, National Bureau of Economic Research, Inc.
    4. Berninghaus, Siegfried K. & Schwalbe, Ulrich, 1996. "Evolution, interaction, and Nash equilibria," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 57-85, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    2. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    3. Gilles, Robert P. & Chakrabarti, Subhadip & Sarangi, Sudipta, 2012. "Nash equilibria of network formation games under consent," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 159-165.

    More about this item

    Keywords

    Strategic games; Network formation; Computational complexity; C72; D02; D85;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D02 - Microeconomics - - General - - - Institutions: Design, Formation, Operations, and Impact
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:spr:reecde:v:12:y:2008:i:1:p:1-19. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.