Overabundant Information and Learning Traps

05/21/2018
by   Annie Liang, et al.
0

We develop a model of social learning from overabundant information: Agents have access to many sources of information, and observation of all sources is not necessary in order to learn the payoff-relevant state. Short-lived agents sequentially choose to acquire a signal realization from the best source for them. All signal realizations are public. Our main results characterize two starkly different possible long-run outcomes, and the conditions under which each obtains: (1) efficient information aggregation, where the community eventually achieves the highest possible speed of learning; (2) "learning traps," where the community gets stuck using a suboptimal set of sources and learns inefficiently slowly. A simple property of the correlation structure separates these two possibilities. In both regimes, we characterize which sources are observed in the long run and how often.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2021

Learning in Repeated Interactions on Networks

We study how long-lived, rational, exponentially discounting agents lear...
research
01/11/2021

The Gaze and Mouse Signal as additional Source for User Fingerprints in Browser Applications

In this work we inspect different data sources for browser fingerprints....
research
01/10/2018

Reasoning about Unforeseen Possibilities During Policy Learning

Methods for learning optimal policies in autonomous agents often assume ...
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
08/20/2022

Strategic Communication with Cost-Dependent Decoders via the Gray-Wyner Network

In decentralized decision-making problems, communicating agents choose t...
research
06/25/2020

A mechanism to promote social behaviour in household load balancing

Reducing the peak energy consumption of households is essential for the ...
research
06/25/2014

Learning the ergodic decomposition

A Bayesian agent learns about the structure of a stationary process from...

Please sign up or login with your details

Forgot password? Click here to reset