How fragile are information cascades?

Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella StuhlarXiv 2017 · OpenReview

TL;DR

This paper investigates how to break "wrong" information cascades, where a group collectively makes an incorrect decision due to following previous actions. The authors show that introducing a small fraction of "revealers" who ignore others and rely solely on their private information can prevent these cascades. They derive the optimal rate at which the error probability decays, showing it's proportional to $1/t$, and identify the precise probability $p_t = c/t$ for agents to act as revealers to achieve this optimal learning.

What Problem Does This Paper Address?

Information cascades are a phenomenon where individuals, observing the actions of those before them, rationally choose to ignore their own private information and instead imitate the previous actions. While this can be efficient, it has a critical flaw: if the initial few actions are wrong, the entire group can fall into a "wrong cascade," making a collectively incorrect decision. This is particularly problematic because cascades can be based on very little initial information, making them fragile but also difficult to break once formed. The paper addresses the question of how to quantitatively break these wrong cascades and achieve learning of the correct state of the world, and what is the optimal rate at which this learning can occur.

Methods

The authors introduce a model where agents are either "Bayesians" (who rationally update their beliefs based on private signals and observed actions) or "revealers" (who disregard observed actions and solely follow their private signal). They analyze this model to understand how the presence of revealers affects the formation and breaking of cascades. The core of their analysis involves deriving the asymptotic rate of learning, which is the rate at which the probability of an incorrect guess goes to zero as time progresses. They use probabilistic tools, including martingale theory and Chernoff bounds, to establish both upper and lower bounds on this error probability. The key is to find the optimal probability $p_t$ for an agent at time $t$ to be a revealer.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Revealers as Cascade Breakers: The presence of even a small, carefully chosen fraction of "revealers" is sufficient to break wrong information cascades and enable learning. This highlights that deviations from pure Bayesian rationality can be beneficial for collective learning.
  • Optimal Revealing Strategy: The optimal strategy for breaking cascades involves agents acting as revealers with a probability $p_t$ that decays as $1/t$. This specific decay rate is crucial for achieving the fastest possible learning.
  • Fragility and Learning Rate: The paper quantifies the fragility of cascades by showing that the error probability can be driven to zero at a rate of $1/t$. This rate is shown to be optimal, meaning no faster learning is possible under the given model.
  • Trade-off in Revealer Probability: If $p_t$ decays too quickly, there might be too few revealers to break a cascade. If $p_t$ decays too slowly, the revealers themselves might be too influenced by the cascade, diminishing their breaking power. The $1/t$ rate strikes the perfect balance.

Key Results

The paper's main result is Theorem 1.1, which states that the optimal asymptotic rate of learning is $1/t$. Specifically, the error probability $E_t$ (the probability of an incorrect guess at time $t$) satisfies:

$$ \inf_{\{p_t\}_{t=1}^\infty} \limsup_{t \to \infty} t E_t = \kappa^*(a,b) $$

where $\kappa^*(a,b)$ is an explicit constant dependent on the signal informativeness parameters $a$ and $b$. The optimal policy for the revealing probability is $p_t = c/t$ for some constant $c$, which leads to an error rate of $E_t \sim c'/t$. The paper provides explicit formulas for these constants.

Limitations and Future Work

  • Model Simplifications: The model assumes a simple binary state of the world and binary private signals, with a uniform prior. Generalizing to more states, non-uniform priors, or more complex signal structures is a natural next step.
  • Known Revealing Probabilities: The current model assumes players know the revealing probabilities $\{p_t\}$. Future work could explore scenarios where these probabilities are unknown or misestimated.
  • Alternative Objectives: While asymptotic learning is the focus, the paper suggests exploring other objectives, such as minimizing the expected number of errors until time $t$.
  • Behavioral Models: The paper considers a specific behavioral deviation (revealers). Investigating other forms of non-Bayesian behavior could offer broader insights into cascade dynamics.
  • Parameter Estimation: The paper focuses on determining the order of magnitude of learning rates. Precisely determining the constants for more complex scenarios will likely require deeper analysis.

Summary updated

Abstract

It is well known that sequential decision making may lead to information cascades. That is, when agents make decisions based on their private information, as well as observing the actions of those before them, then it might be rational to ignore their private signal and imitate the action of previous individuals. If the individuals are choosing between a right and a wrong state, and the initial actions are wrong, then the whole cascade will be wrong. This issue is due to the fact that cascades can be based on very little information. We show that if agents occasionally disregard the actions of others and base their action only on their private information, then wrong cascades can be avoided. Moreover, we study the optimal asymptotic rate at which the error probability at time $t$ can go to zero. The optimal policy is for the player at time $t$ to follow their private information with probability $p_{t} = c/t$, leading to a learning rate of $c'/t$, where the constants $c$ and $c'$ are explicit.
BibTeX
@misc{peres2017how,
  author = {Yuval Peres and Miklós Z. Rácz and Allan Sly and Izabella Stuhl},
  title = {{How fragile are information cascades?}},
  year = {2017},
  eprint = {1711.04024},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1711.04024},
}

Loading related content...

Figure