Risk-sharing agreements on social networks
This paper investigates self-enforcing risk-sharing agreements in a society, if only binary transfers are allowed, among agents connected by social links. A social link between two agents represents another activity they are involved in together. It also serves as a collateral, to enforce transfer payments specified by the risk-sharing agreement. Given an arbitrary network structure and link values, we characterize the set of incentive compatible agreements, and its efficient frontier. All efficient agreements imply that for any endowment vector realization there are connected blocks of players who completely coinsure each other, and links that connect the block to outsiders operate at full capacity. However, these blocks are different for different endowment realizations, as opposed to models which specify constant risk-sharing groups. We show that under general conditions (i) full risk-sharing is not possible in large networks; (ii) the covariance of the consumption of two distant agents is small; (iii) changing only the correlation of individual endowments does not change the set of efficient risk-sharing agreements, only ex ante welfare. We relate our results to empirical findings on social insurance within and across villages in developing countries.
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:||2007|
|Contact details of provider:|| Postal: Society for Economic Dynamics Marina Azzimonti Department of Economics Stonybrook University 10 Nicolls Road Stonybrook NY 11790 USA|
Web page: http://www.EconomicDynamics.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:red:sed007:985. 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: (Christian Zimmermann)
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.