IDEAS home Printed from https://ideas.repec.org/p/swe/wpaper/2007-31.html
   My bibliography  Save this paper

Generic Determinacy of Nash Equilibrium in Network Formation Games

Author

Listed:
  • Carlos Pimienta

    (School of Economics, The University of New South Wales)

Abstract

This paper shows that the set of probability distributions over networks induced by Nash equilibria of the network formation game proposed by Myerson (1991) is finite for a generic assignment of payoffs to networks. The same result can be extended to several variations of the game found in the literature.

Suggested Citation

  • Carlos Pimienta, 2007. "Generic Determinacy of Nash Equilibrium in Network Formation Games," Discussion Papers 2007-31, School of Economics, The University of New South Wales.
    • Handle: RePEc:swe:wpaper:2007-31
    as

    Download full text from publisher

    File URL: http://wwwdocs.fce.unsw.edu.au/economics/Research/WorkingPapers/2007_31.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Kreps, David M & Wilson, Robert, 1982. "Sequential Equilibria," Econometrica, Econometric Society, vol. 50(4), pages 863-894, July.
    2. Francesco Sinopoli & Giovanna Iannantuoni, 2005. "On the generic strategic stability of Nash equilibria if voting is costly," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 25(2), pages 477-486, February.
    3. Kukushkin, Nikolai S. & Litan, Cristian M. & Marhuenda, Francisco, 2008. "On the generic finiteness of equilibrium outcome distributions in bimatrix game forms," Journal of Economic Theory, Elsevier, vol. 139(1), pages 392-395, March.
    4. 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.
    5. De Sinopoli, Francesco, 2001. "On the Generic Finiteness of Equilibrium Outcomes in Plurality Games," Games and Economic Behavior, Elsevier, vol. 34(2), pages 270-286, February.
    6. 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.
    7. 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.
    8. Park, In-Uck, 1997. "Generic Finiteness of Equilibrium Outcome Distributions for Sender-Receiver Cheap-Talk Games," Journal of Economic Theory, Elsevier, vol. 76(2), pages 431-448, October.
    9. Calvo-Armengol, Antoni, 2004. "Job contact networks," Journal of Economic Theory, Elsevier, vol. 115(1), pages 191-206, March.
    10. Kukushkin, Nicolai S. & Litan, Cristian M., 2007. "On the generic finiteness of outcome distributions for bimatrix game forms," UC3M Working papers. Economics we073520, Universidad Carlos III de Madrid. Departamento de Economía.
    11. Jackson, Matthew O. & Watts, Alison, 2002. "The Evolution of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 106(2), pages 265-295, October.
    12. Rachel E. Kranton & Deborah F. Minehart, 2001. "A Theory of Buyer-Seller Networks," American Economic Review, American Economic Association, vol. 91(3), pages 485-508, June.
    13. 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.
    14. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    15. Matthew O. Jackson, 2003. "A survey of models of network formation: Stability and efficiency," Working Papers 1161, California Institute of Technology, Division of the Humanities and Social Sciences.
    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. Meroni, Claudia & Pimienta, Carlos, 2017. "The structure of Nash equilibria in Poisson games," Journal of Economic Theory, Elsevier, vol. 169(C), pages 128-144.
    2. 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.
    3. Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    4. Philippe Bich & Julien Fixary, 2021. "Oddness of the number of Nash equilibria: the case of polynomial payoff functions," Post-Print halshs-03354269, HAL.
    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. De Sinopoli, Francesco & Pimienta, Carlos, 2010. "Costly network formation and regular equilibria," Games and Economic Behavior, Elsevier, vol. 69(2), pages 492-497, July.
    7. Philippe Bich & Julien Fixary, 2021. "Structure and oddness theorems for pairwise stable networks," Post-Print halshs-03287524, HAL.
    8. 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.
    9. 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.
    10. 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.

    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. De Sinopoli, Francesco & Pimienta, Carlos, 2010. "Costly network formation and regular equilibria," Games and Economic Behavior, Elsevier, vol. 69(2), pages 492-497, July.
    2. 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.
    3. Michael Caldara & Michael McBride, 2014. "An Experimental Study of Network Formation with Limited Observation," Working Papers 141501, University of California-Irvine, Department of Economics.
    4. Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    5. Meroni, Claudia & Pimienta, Carlos, 2017. "The structure of Nash equilibria in Poisson games," Journal of Economic Theory, Elsevier, vol. 169(C), pages 128-144.
    6. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    7. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    8. Sofia Priazhkina & Samuel Palmer & Pablo Martín-Ramiro & Román Orús & Samuel Mugel & Vladimir Skavysh, 2024. "Digital Payments in Firm Networks: Theory of Adoption and Quantum Algorithm," Staff Working Papers 24-17, Bank of Canada.
    9. Roland Pongou & Roberto Serrano, 2009. "A dynamic theory of fidelity networks with an application to the spread of HIV/AIDS," Working Papers 2009-03, Instituto Madrileño de Estudios Avanzados (IMDEA) Ciencias Sociales.
    10. Sanjeev Goyal & Marco J. van der Leij & José Luis Moraga-Gonzalez, 2006. "Economics: An Emerging Small World," Journal of Political Economy, University of Chicago Press, vol. 114(2), pages 403-432, April.
    11. Charness, Gary & Jackson, Matthew O., 2007. "Group play in games and the role of consent in network formation," Journal of Economic Theory, Elsevier, vol. 136(1), pages 417-445, September.
    12. Carayol, Nicolas & Roux, Pascale, 2009. "Knowledge flows and the geography of networks: A strategic model of small world formation," Journal of Economic Behavior & Organization, Elsevier, vol. 71(2), pages 414-427, August.
    13. 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.
    14. Cristian Litan & Francisco Marhuenda & Peter Sudhölter, 2020. "Generic finiteness of equilibrium distributions for bimatrix outcome game forms," Annals of Operations Research, Springer, vol. 287(2), pages 801-810, April.
    15. Jackson, Matthew O. & Zenou, Yves, 2015. "Games on Networks," Handbook of Game Theory with Economic Applications,, Elsevier.
    16. 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.
    17. Marco Mantovani & Georg Kirchsteiger & Ana Mauleon & Vincent Vannetelbosch, 2011. "Myopic or Farsighted? An Experiment on Network Formation," Working Papers 2011.45, Fondazione Eni Enrico Mattei.
    18. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    19. Bryan S. Graham, 2015. "Methods of Identification in Social Networks," Annual Review of Economics, Annual Reviews, vol. 7(1), pages 465-485, August.
    20. Jun, Tackseung & Kim, Jeong-Yoo, 2007. "Connectivity, stability and efficiency in a network as an information flow," Mathematical Social Sciences, Elsevier, vol. 53(3), pages 314-331, May.

    More about this item

    Keywords

    Networks; generic finiteness; Nash Equilibrium;
    All these keywords.

    JEL classification:

    • C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • L14 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Transactional Relationships; Contracts and Reputation

    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:swe:wpaper:2007-31. 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: Hongyi Li (email available below). General contact details of provider: https://edirc.repec.org/data/senswau.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.