Meet meets join: the interaction between pooled and common knowledge

Abstract

This paper explores the lattice-theoretic properties of the family of all partitions of an arbitrary state space. I discuss a duality correspondence connecting meets (finest common coarsening) and joins (coarsest common refinement) of families of partitions, which conforms to the natural order-theoretic representations of these two operations. The partition lattice turns out to fail to be a distributive, or even a modular, lattice. I provide intuitive interpretations of these negative results in terms of the interaction between common knowledge and pooling multiple sources of private information, with applications to information exchange within and between different populations and to criminal-procedure law.