How do Interactions Influence Formation of Social Networks? A General Microfounded Explanation
This paper investigates the strategic interaction effects that precede network formation. We find that for a general class of payoff functions which, among other things, feature strict supermodularity, the degree of a node is a sufficient statistic for the action it undertakes. Dynamically, we construct a general model where each period consists of two stages: first, a game on the given network is played and second, a link is either created or severed. It turns out that the payoff functions we consider give absolute convergence to the absorbing class of networks called nested split graphs. These networks do not only possess mathematically tractable characteristics, but we can also interpret real-world networks as perturbed nested split graphs. The general framework provided here can be applied to more or less complex models of network formation.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||08 Sep 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.iies.su.se/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:hhs:iiessp:0761. 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: (Hanna Christiansson)
If references are entirely missing, you can add them using this form.