IDEAS home Printed from https://ideas.repec.org/p/ore/uoecwp/2001-3.html

Strongly Stable Networks

Author

Listed:
  • Matthew O. Jackson

    (University of Oregon Economics Department)

Abstract

We analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coincide with the set of efficient networks (those maximizing the total productive value). We show that the existence of strongly stable networks is equivalent to core existence in a derived cooperative game and use that result to characterize the class of value functions for which there exist strongly stable networks via a "top convexity" condition on the value function on networks. We also consider a variation on strong stability where players can make side payments, and examine situations where value functions may be non-anonymous depending on player labels.

Suggested Citation

  • Matthew O. Jackson, 2001. "Strongly Stable Networks," University of Oregon Economics Department Working Papers 2001-3, University of Oregon Economics Department, revised 15 Nov 2002.
    • Handle: RePEc:ore:uoecwp:2001-3
    as

    Download full text from publisher

    File URL: http://economics.uoregon.edu/papers/UO-2001-3_Jackson_Strongly_Stable.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    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:ore:uoecwp:2001-3. 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: Bill Harbaugh (email available below). General contact details of provider: https://edirc.repec.org/data/deuorus.html .

    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.