Skip to main content
Article thumbnail
Location of Repository

Dynamics of information exchange in endogenous social networks

By Daron Acemoglu, Kostas Bimpikis and Asuman Ozdaglar

Abstract

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An underlying state determines payoffs from different actions. Agents decide which others to form a costly communication link with incurring the associated cost. After receiving a private signal correlated with the underlying state, they exchange information over the induced communication network until taking an (irreversible) action. We define asymptotic learning as the fraction of agents taking the correct action converging to one as a society grows large. Under truthful communication, we show that asymptotic learning occurs if (and under some additional conditions, also only if) in the induced communication network most agents are a short distance away from “information hubs”, which receive and distribute a large amount of information. Asymptotic learning therefore requires information to be aggregated in the hands of a few agents. We also show that while truthful communication may not always be a best response, it is an equilibrium when the communication network induces asymptotic learning. Moreover, we contrast equilibrium behavior with a socially optimal strategy profile, i.e., a profile that maximizes aggregate welfare. We show that when the network induces asymptotic learning, equilibrium behavio

Topics: information aggregation, learning, search, social networks
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.5254
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://economics.mit.edu/files... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.