Characterizing common priors in the form of posteriors
Roughly speaking, the Common Prior Assumption (CPA) means that rational agents in models with asymmetric information have a common prior. \textit{R. J. Aumann} [Ann. Stat. 4, 1236-1239 (1976; Zbl 0379.62003)] proved that if CPA holds then agents cannot agree to disagree. In the present paper the converse statement is proved under an appropriate compactness condition. Also an example is given which demonstrates that the compactness assumption cannot be discarded. For a characterization of the CPA, the author adopts two distinct formalisms: the semantic and the syntactic.
scientific article; zbMATH DE number 1484856