MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Rate of Convergence of Learning in Social Networks

Author(s)
Lobel, Ilan; Acemoglu, Daron; Dahleh, Munther A.; Ozdaglar, Asuman E.
Thumbnail
DownloadOzdaglar_Rate of.pdf (163.6Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Alternative title
Lower Bounds on the Rate of Learning in Social Networks
Terms of use
Attribution-Noncommercial-Share Alike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
We study the rate of convergence of Bayesian learning in social networks. Each individual receives a signal about the underlying state of the world, observes a subset of past actions and chooses one of two possible actions. Our previous work [1] established that when signals generate unbounded likelihood ratios, there will be asymptotic learning under mild conditions on the social network topology—in the sense that beliefs and decisions converge (in probability) to the correct beliefs and action. The question of the speed of learning has not been investigated, however. In this paper, we provide estimates of the speed of learning (the rate at which the probability of the incorrect action converges to zero). We focus on a special class of topologies in which individuals observe either a random action from the past or the most recent action. We show that convergence to the correct action is faster than a polynomial rate when individuals observe the most recent action and is at a logarithmic rate when they sample a random action from the past. This suggests that communication in social networks that lead to repeated sampling of the same individuals lead to slower aggregation of information.
Date issued
2009-07
URI
http://hdl.handle.net/1721.1/61320
Department
Massachusetts Institute of Technology. Department of Economics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Operations Research Center
Journal
Proceedings of the American Control Conference, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Lobel, I. et al. “Lower bounds on the rate of learning in social networks.” American Control Conference, 2009. ACC '09. 2009. 2825-2830.
Version: Author's final manuscript
Other identifiers
INSPEC Accession Number: 10776036
ISBN
978-1-4244-4523-3
ISSN
0743-1619

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.