This paper analyzes the formation of networks when players choose how much to invest in each relationship. We suppose that players have a fixed endowment that they can allocate across links, and in the baseline model, suppose that link strength is an additively separable and convex function of individual investments, and that agents use the path which maximizes the product of link strengths. We show that both the stable and efficient network architectures are stars. However, the investments of the hub may differ in stable and efficient networks. Under alternative assumptions on the investment technology and the reliability measure, other network architectures can emerge as efficient and stable.
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.
Find related papers by JEL classification: D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
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.:
Dutta, Bhaskar & Mutuswami, Suresh, 1996.
"Stable Networks,"
Working Papers
971, California Institute of Technology, Division of the Humanities and Social Sciences.
[Downloadable!]
Cited by: (explanations, 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.)