Confirming Information Flows in Networks

Sudipta Sarangi, Pascal Billand, Christophe Bravard and Jurjen Kamphorst

Departmental Working Papers from Department of Economics, Louisiana State University

Abstract: Our paper belongs to the strand of literature associated with the notion of Nash networks introduced by Bala and Goyal [1] in the connections model. Our aim is to consider situations where agent i has concerns about the validity of information that she acquires from agent j. Independently confirming this information through another set of agents allows i to put more faith in j's information, that is increases the value of j's information. In such situations, we characterize the set of strict Nash networks. Then, we provide a condition which ensures the existence of Nash networks when agents play pure strategies. Finally, we characterize the set of strict efficient networks and we discuss the relationship between efficient networks and strict Nash networks.

Date: 2012-02
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.lsu.edu/business/economics/files/workingpapers/pap12_02.pdf (application/pdf)

Related works:
Working Paper: Confirming information flows in networks (2013)
Working Paper: Confirming Information flows in Networks (2013)
Working Paper: Confirming Information Flows in Networks (2013)
Working Paper: Confirming Information Flows in Networks (2012)
Working Paper: Confirming information flows in networks (2011)
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:lsu:lsuwpp:2012-02

Access Statistics for this paper

More papers in Departmental Working Papers from Department of Economics, Louisiana State University Contact information at EDIRC.
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).