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

Structure and oddness theorems for pairwise stable 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, UP1 - Université Paris 1 Panthéon-Sorbonne, 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

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

Abstract

We determine the topological structure of the graph of pairwise stable weighted networks. As an application, we obtain that for large classes of polynomial payoff functions, there exists generically an odd number of pairwise stable networks. This improves the results in Bich and Morhaim ([5]) or in Herings and Zhan ([14]), and can be applied to many existing models, as for example to the public good provision model of Bramoullé and Kranton ([8]), the information transmission model of Calvó-Armengol ([9]), the two-way flow model of Bala and Goyal ([2]), or Zenou-Ballester's key-player model ([3]).

Suggested Citation

  • Philippe Bich & Julien Fixary, 2021. "Structure and oddness theorems for pairwise stable networks," Post-Print halshs-03287524, HAL.
    • Handle: RePEc:hal:journl:halshs-03287524
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-03287524
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-03287524/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pimienta, Carlos, 2009. "Generic determinacy of Nash equilibrium in network-formation games," Games and Economic Behavior, Elsevier, vol. 66(2), pages 920-927, July.
    2. Coralio Ballester & Antoni Calvó-Armengol & Yves Zenou, 2006. "Who's Who in Networks. Wanted: The Key Player," Econometrica, Econometric Society, vol. 74(5), pages 1403-1417, September.
    3. Blume, Lawrence E & Zame, William R, 1994. "The Algebraic Geometry of Perfect and Sequential Equilibrium," Econometrica, Econometric Society, vol. 62(4), pages 783-794, July.
    4. Govindan, Srihari & Wilson, Robert, 2001. "Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes," Econometrica, Econometric Society, vol. 69(3), pages 765-769, May.
    5. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    6. Mas-Colell, Andreu, 2010. "Generic finiteness of equilibrium payoffs for bimatrix games," Journal of Mathematical Economics, Elsevier, vol. 46(4), pages 382-383, July.
    7. Predtetchinski, Arkadi, 2009. "A general structure theorem for the Nash equilibrium correspondence," Games and Economic Behavior, Elsevier, vol. 66(2), pages 950-958, July.
    8. Govindan, Srihari & McLennan, Andrew, 2001. "On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms," Econometrica, Econometric Society, vol. 69(2), pages 455-471, March.
    9. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    10. Kohlberg, Elon & Mertens, Jean-Francois, 1986. "On the Strategic Stability of Equilibria," Econometrica, Econometric Society, vol. 54(5), pages 1003-1037, September.
    11. Philippe Bich & Lisa Morhaim, 2020. "On the Existence of Pairwise Stable Weighted Networks," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1393-1404, November.
    12. Herings, P. Jean-Jacques & Zhan, Yang, 2021. "The computation of pairwise stable networks," Research Memorandum 004, Maastricht University, Graduate School of Business and Economics (GSBE).
    13. Philippe Bich & Lisa Morhaim, 2017. "On the existence of Pairwise stable weighted networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01564591, HAL.
    14. Philippe Bich & Lisa Morhaim, 2017. "On the existence of Pairwise stable weighted networks," Working Papers halshs-01564591, HAL.
    15. Herings, P.J.J. & Peeters, R.J.A.P., 2000. "A differentiable homotopy to compute nash equilibria of n-person games," Research Memorandum 033, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    16. Bramoulle, Yann & Kranton, Rachel, 2007. "Public goods in networks," Journal of Economic Theory, Elsevier, vol. 135(1), pages 478-494, July.
    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. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Post-Print halshs-03354269, HAL.
    2. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the Case of Polynomial Payoff Functions," Documents de travail du Centre d'Economie de la Sorbonne 21027, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03354269, HAL.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Philippe Bich & Julien Fixary, 2021. "Structure and oddness theorems for pairwise stable networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03287524, HAL.
    2. Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    3. Bich, Philippe & Fixary, Julien, 2024. "Oddness of the number of Nash equilibria: The case of polynomial payoff functions," Games and Economic Behavior, Elsevier, vol. 145(C), pages 510-525.
    4. Pimienta, Carlos, 2010. "Generic finiteness of outcome distributions for two-person game forms with three outcomes," Mathematical Social Sciences, Elsevier, vol. 59(3), pages 364-365, May.
    5. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the Case of Polynomial Payoff Functions," Documents de travail du Centre d'Economie de la Sorbonne 21027, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    6. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03354269, HAL.
    7. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Post-Print halshs-03354269, HAL.
    8. Meroni, Claudia & Pimienta, Carlos, 2017. "The structure of Nash equilibria in Poisson games," Journal of Economic Theory, Elsevier, vol. 169(C), pages 128-144.
    9. De Sinopoli, Francesco & Pimienta, Carlos, 2010. "Costly network formation and regular equilibria," Games and Economic Behavior, Elsevier, vol. 69(2), pages 492-497, July.
    10. Acemoglu, Daron & Malekian, Azarakhsh & Ozdaglar, Asu, 2016. "Network security and contagion," Journal of Economic Theory, Elsevier, vol. 166(C), pages 536-585.
    11. Pimienta, Carlos, 2009. "Generic determinacy of Nash equilibrium in network-formation games," Games and Economic Behavior, Elsevier, vol. 66(2), pages 920-927, July.
    12. , D. & Tessone, Claudio J. & ,, 2014. "Nestedness in networks: A theoretical model and some applications," Theoretical Economics, Econometric Society, vol. 9(3), September.
    13. Acemoglu, Daron & Makhdoumi, Ali & Malekian, Azarakhsh & Ozdaglar, Asuman, 2017. "Privacy-constrained network formation," Games and Economic Behavior, Elsevier, vol. 105(C), pages 255-275.
    14. M. Koenig & Claudio J. Tessone & Yves Zenou, "undated". "A Dynamic Model of Network Formation with Strategic Interactions," Working Papers CCSS-09-006, ETH Zurich, Chair of Systems Design.
    15. Jackson, Matthew O. & Zenou, Yves, 2015. "Games on Networks," Handbook of Game Theory with Economic Applications,, Elsevier.
    16. Syngjoo Choi & Edoardo Gallo & Shachar Kariv, 2015. "Networks in the laboratory," Cambridge Working Papers in Economics 1551, Faculty of Economics, University of Cambridge.
    17. Lippert, Steffen & Spagnolo, Giancarlo, 2011. "Networks of relations and Word-of-Mouth Communication," Games and Economic Behavior, Elsevier, vol. 72(1), pages 202-217, May.
    18. Zenou, Yves, 2012. "Networks in Economics," CEPR Discussion Papers 9021, C.E.P.R. Discussion Papers.
    19. Dunia Lopez-Pintado, 2016. "Influence networks and public goods," UMASS Amherst Economics Working Papers 2016-12, University of Massachusetts Amherst, Department of Economics.
    20. Xiao Luo & Xuewen Qian & Yang Sun, 2021. "The algebraic geometry of perfect and sequential equilibrium: an extension," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(2), pages 579-601, March.

    More about this item

    Keywords

    Weighted Networks; Pairwise Stable Networks Correspondence; Generic oddness;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:halshs-03287524. 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.

    If CitEc recognized a bibliographic 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.

    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.