IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v69y2010i2p492-497.html
   My bibliography  Save this article

Costly network formation and regular equilibria

Author

Listed:
  • De Sinopoli, Francesco
  • Pimienta, Carlos

Abstract

We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.

Suggested Citation

  • De Sinopoli, Francesco & Pimienta, Carlos, 2010. "Costly network formation and regular equilibria," Games and Economic Behavior, Elsevier, vol. 69(2), pages 492-497, July.
    • Handle: RePEc:eee:gamebe:v:69:y:2010:i:2:p:492-497
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(09)00236-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    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. 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. 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.
    4. 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.
    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. 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.
    7. Calvo-Armengol, Antoni, 2004. "Job contact networks," Journal of Economic Theory, Elsevier, vol. 115(1), pages 191-206, March.
    8. Mertens, J.-F., 1988. "Stable equilibria - a reformulation," LIDAM Discussion Papers CORE 1988038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. 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.
    10. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    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. Julia Müller & Thorsten Upmann, 2017. "Eigenvalue Productivity: Measurement of Individual Contributions in Teams," CESifo Working Paper Series 6679, CESifo.

    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. 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. Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    3. 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.
    4. 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.
    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. Philippe Bich & Julien Fixary, 2021. "Structure and oddness theorems for pairwise stable networks," Post-Print halshs-03287524, HAL.
    7. Dev, Pritha, 2014. "Identity and fragmentation in networks," Mathematical Social Sciences, Elsevier, vol. 71(C), pages 86-100.
    8. 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.
    9. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    10. Möhlmeier, Philipp & Rusinowska, Agnieszka & Tanimura, Emily, 2018. "Competition for the access to and use of information in networks," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 48-63.
    11. 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.
    12. 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.
    13. Isabel Melguizo, 2023. "Group representation concerns and network formation," Bulletin of Economic Research, Wiley Blackwell, vol. 75(1), pages 151-179, January.
    14. Lasse Kliemann, 2011. "The Price of Anarchy for Network Formation in an Adversary Model," Games, MDPI, vol. 2(3), pages 1-31, August.
    15. Michael Caldara & Michael McBride, 2014. "An Experimental Study of Network Formation with Limited Observation," Working Papers 141501, University of California-Irvine, Department of Economics.
    16. 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.
    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. 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.
    19. Buechel Berno, 2009. "Network Formation with Closeness Incentives," Lecture Notes in Economics and Mathematical Systems, in: Ahmad K. Naimzada & Silvana Stefani & Anna Torriero (ed.), Networks, Topology and Dynamics, pages 95-109, Springer.
    20. Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.

    More about this item

    Keywords

    Network-formation games Regular equilibrium Stable sets;

    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

    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:eee:gamebe:v:69:y:2010:i:2:p:492-497. 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/inca/622836 .

    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.