This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Eight degrees of separation

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Paolo Pin () (Department of Economics, University Of Venice Ca’ Foscari)

Additional information is available for the following registered author(s):

Abstract

The paper presents a model of network formation where every connected couple give 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
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.dse.unive.it/fileadmin/templates/dse/wp/WP_DSE_Pin_26_06.pdf
File Format: application/pdf
File Function: First version, 2006
Download Restriction: no

Publisher Info
Paper provided by University of Venice "Ca' Foscari", Department of Economics in its series Working Papers with number 2006_26.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 22 pages
Date of creation: 2006
Date of revision:
Handle: RePEc:ven:wpaper:2006_26

Contact details of provider:
Postal: Cannaregio, S. Giobbe no 873 , 30121 Venezia
Phone: 2574183
Fax: 2574176
Email:
Web page: http://www.dse.unive.it
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Renato Dalla Venezia).

Related research
Keywords: Network Formation; Myerson value;

Other versions of this item:

Find related papers by JEL classification:
D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

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.:

  1. Noemí Navarro & Andrés Perea, 2001. "Bargaining In Networks And The Myerson Value," Economics Working Papers we016121, Universidad Carlos III, Departamento de Economía. [Downloadable!]
  2. Paul Belleflamme & Francis Bloch, 2004. "Market sharing agreements and collusive networks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 387-411, 05. [Downloadable!] (restricted)
    Other versions:
  3. 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. [Downloadable!] (restricted)
    Other versions:
  4. 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. [Downloadable!] (restricted)
    Other versions:
  5. Gul, Faruk, 1989. "Bargaining Foundations of Shapley Value," Econometrica, Econometric Society, vol. 57(1), pages 81-95, January. [Downloadable!] (restricted)
  6. Jackson, Matthew O. & Rogers, Brian W., 2005. "Search in the formation of large networks: How random are socially generated networks?," Working Papers 1216, California Institute of Technology, Division of the Humanities and Social Sciences. [Downloadable!]
    Other versions:
  7. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April. [Downloadable!] (restricted)
    Other versions:
  8. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May. [Downloadable!] (restricted)
  9. Goyal, Sanjeev & Vega-Redondo, Fernando, 2007. "Structural holes in social networks," Journal of Economic Theory, Elsevier, vol. 137(1), pages 460-492, November. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? IDEAS was launched in September 1997.

This page was last updated on 2009-11-25.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.