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

Confirming Information Flows in Networks

Contents:

Author Info

  • Pascal Billand

    (Universite de Lyon, Universite Jean Monnet, Saint-Etienne, CNRS, GATE)

  • Christophe Bravard

    (Universite de Lyon, Universite Jean Monnet, Saint-Etienne, CNRS, GATE)

  • Jurjen Kamphorst

    (Erasmus University Rotterdam)

  • Sudipta Sarangi

    (DIW Berlin and Louisiana State University)

Abstract

Social networks, be it on the internet or in real life, facilitate information flows. We model this by giving agents incentives to link with others and receive information through those links. In many networks agents will value confirmation of the information they receive from others. Our paper analyzes the impact such a need for confirmation has on the social networks which are formed. We first study the existence of Nash equilibria and then characterize the set of strict Nash networks. Next, we characterize the set of strictly efficient networks and discuss the relationship between strictly efficient networks and strict Nash networks.

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://papers.tinbergen.nl/12019.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 12-019/1.

as in new window
Length:
Date of creation: 01 Mar 2012
Date of revision:
Handle: RePEc:dgr:uvatin:20120019

Contact details of provider:
Web page: http://www.tinbergen.nl

Related research

Keywords: connections model; confirmation; two-way flow models;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

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. K. De Jaegher & J.J.A. Kamphorst, 2010. "Two-way Flow Networks with Small Decay," Tinbergen Institute Discussion Papers 10-125/1, Tinbergen Institute.
  2. Bala, Venkatesh & Goyal, Sanjeev, 1998. "Learning from Neighbours," Review of Economic Studies, Wiley Blackwell, vol. 65(3), pages 595-621, July.
  3. K.J.M. De Jaegher & J.J.A. Kamphorst, 2008. "Network formation with decreasing marginal benefits of information," Working Papers 08-16, Utrecht School of Economics.
  4. Andrea Galeotti & Sanjeev Goyal, 2007. "The Law of the Few," Economics Discussion Papers 636, University of Essex, Department of Economics.
  5. Kim, Chongmin & Wong, Kam-Chau, 2007. "Network formation and stable equilibrium," Journal of Economic Theory, Elsevier, vol. 133(1), pages 536-549, March.
  6. Andrea Galeotti & Sanjeev Goyal & Jurjen Kamphorst, 2003. "Network Formation with Heterogeneous Players," Economics Discussion Papers 562, University of Essex, Department of Economics.
  7. Sudipta Sarangi & Pascal Billand & Christophe Bravard, . "On the Interaction between Heterogeneity and Decay in Directed Networks," Departmental Working Papers 2010-04, Department of Economics, Louisiana State University.
  8. Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  9. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Strict Nash networks and partner heterogeneity," International Journal of Game Theory, Springer, vol. 40(3), pages 515-525, August.
  10. Hojman, Daniel A. & Szeidl, Adam, 2008. "Core and periphery in networks," Journal of Economic Theory, Elsevier, vol. 139(1), pages 295-309, March.
  11. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Nash Networks With Imperfect Reliability And Heterogeous Players," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 13(02), pages 181-194.
  12. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
  13. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
  14. Venkatesh Bala & Sanjeev Goyal, 2000. "original papers : A strategic analysis of network reliability," Review of Economic Design, Springer, vol. 5(3), pages 205-228.
Full references (including those not matched with items on IDEAS)

Citations

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:dgr:uvatin:20120019. 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: (Antoine Maartens (+31 626 - 160 892)).

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.