Bayesian Social Learning in a Dynamic Environment

01/06/2018
by   Krishna Dasaratha, et al.
0

Bayesian agents learn about a moving target, such as a commodity price, using private signals and their network neighbors' estimates. The weights agents place on these sources of information are endogenously determined by the precisions and correlations of the sources; the weights, in turn, determine future correlations. We study stationary equilibria-ones in which all of these quantities are constant over time. Equilibria in linear updating rules always exist, yielding a Bayesian learning model as tractable as the commonly-used DeGroot heuristic. Equilibria and the comparative statics of learning outcomes can be readily computed even in large networks. Substantively, we identify pervasive inefficiencies in Bayesian learning. In any stationary equilibrium where agents put positive weights on neighbors' actions, learning is Pareto inefficient in a generic network: agents rationally overuse social information and underuse their private signals.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2018

On Increasing Self-Confidence in Non-Bayesian Social Learning over Time-Varying Directed Graphs

We study the convergence of the log-linear non-Bayesian social learning ...
research
12/28/2021

Learning in Repeated Interactions on Networks

We study how long-lived, rational, exponentially discounting agents lear...
research
05/12/2022

Social learning via actions in bandit environments

I study a game of strategic exploration with private payoffs and public ...
research
01/26/2023

The Hazards and Benefits of Condescension in Social Learning

In a misspecified social learning setting, agents are condescending if t...
research
05/02/2019

Price of Privacy in the Keynesian Beauty Contest

The Keynesian Beauty Contest is a classical game in which strategic agen...
research
09/04/2018

Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard

We study the Bayesian model of opinion exchange of fully rational agents...
research
07/04/2022

Reaching optimal distributed estimation through myopic self-confidence adaptation

Consider discrete-time linear distributed averaging dynamics, whereby ag...

Please sign up or login with your details

Forgot password? Click here to reset