Advanced Search
MyIDEAS: Login

Eight Degrees of Separation

Contents:

Author Info

  • Paolo Pin

    (Università Ca’Foscari Venezia)

Abstract

The paper presents a model of network formation where every connected couple gives a contribution to the aggregate payoff, eventually discounted by their distance, and the resources are split between agents through the Myerson value. As equilibrium concept we adopt a refinement of pairwise stability. The only parameters are the number N of agents and a constant cost k for every agent to maintain any single link. This setup shows a wide multiplicity of equilibria, all of them connected, as k ranges over non trivial cases. We are able to show that, for any N, when the equilibrium is a tree (acyclical connected graph), which happens for high k, and there is no decay, the diameter of such a network never exceeds 8 (i.e. there are no two nodes with distance greater than 8). Adopting no decay and studying only trees, we facilitate the analysis but impose worst–case scenarios: we conjecture that the limit of 8 should apply for any possible non–empty equilibrium with any decay function.

Download Info

If 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.
File URL: http://www.feem.it/userfiles/attach/Publication/NDL2006/NDL2006-078.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Fondazione Eni Enrico Mattei in its series Working Papers with number 2006.78.

as in new window
Length:
Date of creation: May 2006
Date of revision:
Handle: RePEc:fem:femwpa:2006.78

Contact details of provider:
Postal: Corso Magenta, 63 - 20123 Milan
Phone: 0039-2-52036934
Fax: 0039-2-52036946
Email:
Web page: http://www.feem.it/
More information through EDIRC

Related research

Keywords: Network Formation; Myerson Value;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. David Pérez-Castrillo & David Wettstein, . "Bidding For The Surplus: A Non-Cooperative Approach To The Shapley Value," UFAE and IAE Working Papers 461.00, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  2. 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.
  3. Paul Belleflamme & Francis Bloch, 2001. "Market Sharing Agreements and Collusive Networks," Working Papers 443, Queen Mary, University of London, School of Economics and Finance.
  4. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
  5. Qin, Cheng-Zhong, 1996. "Endogenous Formation of Cooperation Structures," Journal of Economic Theory, Elsevier, vol. 69(1), pages 218-226, April.
  6. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
  7. Matthew O. Jackson & Brian W. Rogers, 2007. "Meeting Strangers and Friends of Friends: How Random Are Social Networks?," American Economic Review, American Economic Association, vol. 97(3), pages 890-915, June.
  8. Subhadip Chakrabarti & Robert Gilles, 2007. "Network potentials," Review of Economic Design, Springer, vol. 11(1), pages 13-52, June.
  9. Gul, Faruk, 1989. "Bargaining Foundations of Shapley Value," Econometrica, Econometric Society, vol. 57(1), pages 81-95, January.
  10. 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.
  11. (*), Anne van den Nouweland & Marco Slikker, 2000. "original papers : Network formation models with costs for establishing links," Review of Economic Design, Springer, vol. 5(3), pages 333-362.
  12. Noemí Navarro & Andrés Perea, 2001. "Bargaining In Networks And The Myerson Value," Economics Working Papers we016121, Universidad Carlos III, Departamento de Economía.
  13. Matthew O. Jackson & Brian W. Rogers, 2005. "Search in the Formation of Large Networks: How Random are Socially Generated Networks?," Game Theory and Information 0503005, EconWPA.
  14. Goyal, Sanjeev & Vega-Redondo, Fernando, 2007. "Structural holes in social networks," Journal of Economic Theory, Elsevier, vol. 137(1), pages 460-492, November.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2006.78. See general 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: (barbara racah).

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.