Costly network formation and regular equilibria
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 69 (2010)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Network-formation games Regular equilibrium Stable sets;
Other versions of this item:
- 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
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Carlos Pimienta, 2007.
"Generic Determinacy of Nash Equilibrium in Network Formation Games,"
2007-31, School of Economics, The University of New South Wales.
- Pimienta, Carlos, 2009. "Generic determinacy of Nash equilibrium in network-formation games," Games and Economic Behavior, Elsevier, vol. 66(2), pages 920-927, July.
- Francesco De Sinopoli & Giovanna Iannantuoni, 2003.
"On the Generic Strategic Stability of Nash Equilibria if Voting is Costly,"
CEIS Research Paper
41, Tor Vergata University, CEIS.
- Francesco Sinopoli & Giovanna Iannantuoni, 2005. "On the generic strategic stability of Nash equilibria if voting is costly," Economic Theory, Springer, vol. 25(2), pages 477-486, 02.
- De Sinopoli, Francesco & Iannantuoni, Giovanna, . "On the generic strategic stability of nash equilibria if voting is costly," Open Access publications from Universidad Carlos III de Madrid info:hdl:10016/280, Universidad Carlos III de Madrid.
- Francesco De Sinopoli & Giovanna Iannantuoni, 2002. "On The Generic Strategic Stability Of Nash Equilibria If Voting Is Costly," Economics Working Papers we025620, Universidad Carlos III, Departamento de Economía.
- Antoni Calvó-Armengol & Rahmi Ilkiliç, 2005.
"Pairwise-Stability and Nash Equilibria in Network Formation,"
2005.34, Fondazione Eni Enrico Mattei.
- Antoni Calvó-Armengol & Rahmi İlkılıç, 2009. "Pairwise-stability and Nash equilibria in network formation," International Journal of Game Theory, Springer, vol. 38(1), pages 51-79, March.
- Antoni Calvó-Armengol & Rahmi Ilkiliç, 2004. "Pairwise-Stability and Nash Equilibria in Network Formation," Working Papers 182, Barcelona Graduate School of Economics.
- 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.
- Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson & Asher Wolinsky, 1994. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- 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.
- Park, I.U., 1993. "Generic Finiteness of Equilibrium Outcome Distribution for Sender Receiver Cheap-Talk Games," Papers 269, Minnesota - Center for Economic Research.
- Calvo-Armengol, Antoni, 2004. "Job contact networks," Journal of Economic Theory, Elsevier, vol. 115(1), pages 191-206, March.
- Mertens, J.-F., 1988. "Stable equilibria - a reformulation," CORE Discussion Papers 1988038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Govindan, S & McLennan, A, 1997.
"On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms,"
299, Minnesota - Center for Economic Research.
- Govindan, Srihari & McLennan, Andrew, 2001. "On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms," Econometrica, Econometric Society, vol. 69(2), pages 455-71, March.
- Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.