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

Network formation and pairwise stability: A new oddness theorem

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)

  • Julien Fixary

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

We prove that for large classes of polynomial payoff functions, there exist generically an odd number of pairwise stable networks, as a consequence of the topological structure of the graph of pairwise stable weighted networks, which we characterize. This improves recent results in Bich and Morhaim (2020) or in Herings and Zhan (2022), and can be applied to many existing models, as for example to the public good provision model of Bramoullé and Kranton (2007), the information transmission model of Calvó-Armengol and İlkılıç (2009) or the two-way flow model of Bala and Goyal (2000).

Suggested Citation

  • Philippe Bich & Julien Fixary, 2022. "Network formation and pairwise stability: A new oddness theorem," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-03969600, HAL.
    • Handle: RePEc:hal:cesptp:hal-03969600
    DOI: 10.1016/j.jmateco.2022.102767
    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.

    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:hal-03969600. 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.