A Characterization of Farsightedly Stable Networks
AbstractWe study the stability of social and economic networks when players are farsighted. We first provide an algorithm that characterizes the unique pairwise and groupwise farsightedly stable set of networks under the componentwise egalitarian allocation rule. We then show that this set coincides with the unique groupwise myopically stable set of networks but not with the unique pairwise myopically stable set of networks. We conclude that, if groupwise deviations are allowed then whether players are farsighted or myopic does not matter; if players are farsighted then whether players are allowed to deviate in pairs only or in groups does not matter.
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.
Bibliographic InfoArticle provided by MDPI, Open Access Journal in its journal Games.
Volume (Year): 1 (2010)
Issue (Month): 3 (July)
Contact details of provider:
Web page: http://www.mdpi.com/
farsighted players; pairwise deviations; groupwise deviations;
Other versions of this item:
- GRANDJEAN, Gilles & MAULEON, Ana & VENNETELBOSCH, Vincent, . "A characterization of farsightedly stable networks," CORE Discussion Papers RP -2249, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- C - Mathematical and Quantitative Methods
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (XML Conversion Team).
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.