EconPapers    
Economics at your fingertips  
 

The Structure of Information Networks

Sudipta Sarangi, Raj Kannan and Lydia Ray

No 182, Royal Economic Society Annual Conference 2003 from Royal Economic Society

Abstract: We develop a model of information acquisition in a network where agents pay for all the information they acquire including those through indirect links. The cost of information depends on the value of information itself and the distance it traverses in the network. We find that when the costs of information increase with distance, the complete network is the only Nash network. When costs of information decrease with distance capturing delay, all equilibrium information networks are minimally connected, though not all trees are Nash. We analyze the popular star and chain networks and identify strict Nash networks. We show that there is almost no divergence between efficient and equilibrium information networks. We explore the implications of a spatial model and information decay and discuss the relationship with experimental evidence.

Keywords: Nash networks; information networks; efficient networks (search for similar items in EconPapers)
JEL-codes: D82 D83 (search for similar items in EconPapers)
Date: 2003-06-04
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://repec.org/res2003/Sarangi.pdf full text

Related works:
Journal Article: The structure of information networks (2007) Downloads
Working Paper: The Structure of Information Networks (2004) Downloads
Working Paper: The Structure of Information Networks (2003) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecj:ac2003:182

Access Statistics for this paper

More papers in Royal Economic Society Annual Conference 2003 from Royal Economic Society Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().

 
Page updated 2025-03-31
Handle: RePEc:ecj:ac2003:182