Abstract

 
 

References (30)



 
 

Citations (2)



 


 



The Robustness of Consensus in Network-Based Non-Bayesian Learning Models


Manuel Mueller-Frank


University of Oxford - Nuffield College

December 20, 2011


Abstract:     
This paper provides a formal characterization of non-Bayesian updating functions that yield asymptotic consensus in strongly connected networks. Extreme reluctance, a property of opinion formation that has been experimentally validated recently by Lorenz, Rauhut, Schweitzer and Helbing (2011) is shown to be crucial for asymptotic consensus.

The paper further analyzes the robustness of asymptotic consensus when agents are subject to probabilistic mistakes while forming their opinions. A sufficient condition on the stochastic process of errors is characterized such that asymptotic consensus holds almost surely.

As corollaries of the general theorems, new results to the literature on (i) political opinion formation with partisans, and (ii) cognitive dissonance are provided. Partisan and/or cognitive dissonant agents do not perpetuate sharp differences of opinions within social networks. Despite their presence, asymptotic consensus occurs in strongly connected networks.

Number of Pages in PDF File: 33

Keywords: Social learning, consensus, partisans, cognitive dissonance

JEL Classification: D82, D83

working papers series


Download This Paper

Date posted: October 3, 2011 ; Last revised: December 20, 2011

Suggested Citation

Mueller-Frank, Manuel, The Robustness of Consensus in Network-Based Non-Bayesian Learning Models (December 20, 2011). Available at SSRN: http://ssrn.com/abstract=1937089 or http://dx.doi.org/10.2139/ssrn.1937089

Contact Information

Manuel Mueller-Frank (Contact Author)
University of Oxford - Nuffield College ( email )
New Road
Oxford, OX1 1NF
United Kingdom
HOME PAGE: http://www.economics.ox.ac.uk/index.php/staff/mueller-frank/
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 222
Downloads: 36
References:  30
Citations:  2

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo3 in 0.313 seconds