IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v103y2022ics0304406822000933.html
   My bibliography  Save this article

Network formation and pairwise stability: A new oddness theorem

Author

Listed:
  • Bich, Philippe
  • Fixary, Julien

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

  • Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    • Handle: RePEc:eee:mateco:v:103:y:2022:i:c:s0304406822000933
    DOI: 10.1016/j.jmateco.2022.102767
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406822000933
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2022.102767?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Antoni Calvó-Armengol & Rahmi İlkılıç, 2009. "Pairwise-stability and Nash equilibria in network formation," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 51-79, March.
    2. 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.
    3. DeMichelis, Stefano & Germano, Fabrizio, 2000. "On the Indices of Zeros of Nash Fields," Journal of Economic Theory, Elsevier, vol. 94(2), pages 192-217, October.
    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. 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.
    8. Predtetchinski, Arkadi, 2009. "A general structure theorem for the Nash equilibrium correspondence," Games and Economic Behavior, Elsevier, vol. 66(2), pages 950-958, July.
    9. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    10. Pimienta, Carlos, 2009. "Generic determinacy of Nash equilibrium in network-formation games," Games and Economic Behavior, Elsevier, vol. 66(2), pages 920-927, July.
    11. Kohlberg, Elon & Mertens, Jean-Francois, 1986. "On the Strategic Stability of Equilibria," Econometrica, Econometric Society, vol. 54(5), pages 1003-1037, September.
    12. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Post-Print halshs-03354269, HAL.
    13. DeMichelis, Stefano & Germano, Fabrizio, 2000. "Some consequences of the unknottedness of the Walras correspondence," Journal of Mathematical Economics, Elsevier, vol. 34(4), pages 537-545, December.
    14. 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.
    15. P. Jean-Jacques Herings & Ronald J.A.P. Peeters, 2001. "symposium articles: A differentiable homotopy to compute Nash equilibria of n -person games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 18(1), pages 159-185.
    16. Demichelis, Stefano & Germano, Fabrizio, 2002. "On (un)knots and dynamics in games," Games and Economic Behavior, Elsevier, vol. 41(1), pages 46-60, October.
    17. 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.
    18. 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.
    19. 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.
    20. Philippe Bich & Lisa Morhaim, 2017. "On the existence of Pairwise stable weighted networks," Working Papers halshs-01564591, HAL.
    21. 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. 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.

    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. Philippe Bich & Julien Fixary, 2021. "Structure and oddness theorems for pairwise stable networks," Post-Print halshs-03287524, HAL.
    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," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03354269, HAL.
    6. 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.
    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. De Sinopoli, Francesco & Pimienta, Carlos, 2010. "Costly network formation and regular equilibria," Games and Economic Behavior, Elsevier, vol. 69(2), pages 492-497, July.
    9. Meroni, Claudia & Pimienta, Carlos, 2017. "The structure of Nash equilibria in Poisson games," Journal of Economic Theory, Elsevier, vol. 169(C), pages 128-144.
    10. Pimienta, Carlos, 2009. "Generic determinacy of Nash equilibrium in network-formation games," Games and Economic Behavior, Elsevier, vol. 66(2), pages 920-927, July.
    11. Predtetchinski, Arkadi, 2009. "A general structure theorem for the Nash equilibrium correspondence," Games and Economic Behavior, Elsevier, vol. 66(2), pages 950-958, July.
    12. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    13. Demichelis, Stefano & Ritzberger, Klaus, 2003. "From evolutionary to strategic stability," Journal of Economic Theory, Elsevier, vol. 113(1), pages 51-75, November.
    14. Isabel Melguizo, 2023. "Group representation concerns and network formation," Bulletin of Economic Research, Wiley Blackwell, vol. 75(1), pages 151-179, January.
    15. Takahashi, Satoru & Tercieux, Olivier, 2020. "Robust equilibrium outcomes in sequential games under almost common certainty of payoffs," Journal of Economic Theory, Elsevier, vol. 188(C).
    16. 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.
    17. 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.
    18. Dev, Pritha, 2014. "Identity and fragmentation in networks," Mathematical Social Sciences, Elsevier, vol. 71(C), pages 86-100.
    19. Konno, Tomohiko, 2013. "An imperfect competition on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5453-5460.
    20. Cabrales, Antonio & Calvó-Armengol, Antoni & Zenou, Yves, 2011. "Social interactions and spillovers," Games and Economic Behavior, Elsevier, vol. 72(2), pages 339-360, June.

    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:eee:mateco:v:103:y:2022:i:c:s0304406822000933. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.