Information Hierarchies

Working Paper: CEPR ID: DP16790

Authors: Benjamin A. Brooks; Alexander Frankel; Emir Kamenica

Abstract: If experiment A is Blackwell more informative than experiment B, it is always possible that A and B are induced by signals A' and B' such that A' is a refinement of B', that is, A' entails observing B' plus some additional information. We first show that this result does not extend beyond pairs of experiments: There exist collections of experiments that cannot be induced by a collection of signals so that whenever two experiments are Blackwell ordered, the associated signals are refinement ordered. In other words, sometimes it is impossible for more informed agents to know everything that less informed agents know. More broadly, define an information hierarchy to be a partially ordered set that ranks experiments in terms of informativeness. Is it the case that for any choice of experiments indexed on the hierarchy such that higher experiments are Blackwell more informative, there are signals that induce these experiments with higher signals being refinements of lower signals? We show that the answers is affirmative if and only if the undirected graph of the information hierarchy is a forest.

Keywords: information; beliefs; signals; Blackwell order; networks

JEL Codes: C70; D82; D83; D85


Causal Claims Network Graph

Edges that are evidenced by causal inference methods are in orange, and the rest are in light blue.


Causal Claims

CauseEffect
Information hierarchy (D83)Universally constructible (L74)
Undirected graph is a forest (Q23)Information hierarchy is universally constructible (D83)
Higher experiment (Blackwell ordered) (C99)More informed agents (L85)
Higher signals (C58)Refining lower signals (C32)
Structure of hierarchy (L22)Existence of signal allocation (C78)
Certain hierarchies (diamond structure) (Y80)Cannot support signal refinements (C69)

Back to index