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

On the existence of Pairwise stable weighted networks

Author

Listed:
  • Philippe Bich

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Lisa Morhaim

    (CRED - Centre de Recherche en Economie et Droit - UP2 - Université Panthéon-Assas)

Abstract

In network theory, Jackson and Wolinsky introduced a now widely used notion of stability for unweighted network formation called pairwise stability. We prove the existence of pairwise stable weighted networks under assumptions on payoffs that are similar to those in Nash's and Glicksberg's existence theorem (continuity and quasi concavity). Then, we extend our result, allowing payoffs to depend not only on the network, but also on some game-theoretic strategies. The proof is not a standard application of tools from game theory, the difficulty coming from the fact that the pairwise stability notion has both cooperative and noncooperative features. Last, some examples are given and illustrate how our results may open new paths in the literature on network formation.

Suggested Citation

  • Philippe Bich & Lisa Morhaim, 2020. "On the existence of Pairwise stable weighted networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03969712, HAL.
  • Handle: RePEc:hal:cesptp:halshs-03969712
    DOI: 10.1287/moor.2019.1032
    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.

    Citations

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


    Cited by:

    1. John Higgins & Tarun Sabarwal, 2021. "Control and Spread of Contagion in Networks," WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS 202111, University of Kansas, Department of Economics.
    2. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    3. Herings, P. Jean-Jacques, 2024. "Globally and universally convergent price adjustment processes," Journal of Mathematical Economics, Elsevier, vol. 113(C).

    More about this item

    Keywords

    Pairwise Stable Network; Weighted Network;

    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:cesptp:halshs-03969712. 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.