Advanced Search
MyIDEAS: Login to save this paper or follow this series

Revisiting Friendship Networks

Contents:

Author Info

  • Sudipta Sarangi

    ()

  • Aditi Roy

    ()

Abstract

We extend the model of friendship networks developed by Brueck- ner (2006) in two ways. First, we extend the level of indirect benefits by incorporating benefits from up to three links and explore its impli- cation for the socially optimal and individual e¤ort levels. Next, we generalize the magnetic agent problem by allowing for more than 3 players by restricting ourselves to regular networks that include pay- o¤s from the magnetic agent.

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://bus.lsu.edu/McMillin/Working_Papers/pap09_12.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Department of Economics, Louisiana State University in its series Departmental Working Papers with number 2009-12.

as in new window
Length:
Date of creation:
Date of revision:
Handle: RePEc:lsu:lsuwpp:2009-12

Contact details of provider:
Postal: Baton Rouge, LA 70803-6306
Fax: 225-578-3807
Email:
Web page: http://www.business.lsu.edu/economics
More information through EDIRC

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

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. 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.
  2. Francis Bloch & Bhaskar Dutta, 2008. "Communication networks with endogeneous link strength," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 08-15, Indian Statistical Institute, New Delhi, India.
  3. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
  4. Jan K. Brueckner, 2006. "Friendship Networks," Journal of Regional Science, Wiley Blackwell, vol. 46(5), pages 847-865.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific Networking," Games, MDPI, Open Access Journal, vol. 2(1), pages 87-113, February.

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:lsu:lsuwpp:2009-12. 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: ().

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.