By Topic

Reaching Consensus With Increasing Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Molavi, P. ; Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA ; Jadbabaie, A. ; Rad, K.R. ; Tahbaz-Salehi, A.

This paper focuses on a model of opinion formation over networks with continuously flowing new information and studies the relationship between the network and information structures and agents' ability to reach agreement. At each time period, agents receive private signals in addition to observing the beliefs held by their neighbors in a network. Each agent then updates its belief by aggregating the information available to it in a boundedly rational fashion. Whether this model results in conformity or disparity of beliefs is contingent on connectivity of the network and identifiability of the unknown state. We show that if the network is strongly connected, agents will eventually reach consensus in their beliefs; if in addition the state is globally identifiable, then agents will be able to learn the unknown state. Agents will also reach consensus and learn the state if the network fails to be connected but the state is locally identifiable. In contrast, agents in a non-strongly connected network will almost never reach agreement in their beliefs about a locally unidentifiable state. We also provide a characterization of the rates of convergence in terms of the top Lyapunov exponent of a set of i.i.d. matrices. The proofs use Oseledets' multiplicative ergodic theorem and recent results on stability of Lyapunov regular dynamical systems.

Published in:

Selected Topics in Signal Processing, IEEE Journal of  (Volume:7 ,  Issue: 2 )