In this note, we extend Aumann’s agreement theorem to a framework where beliefs are modelled by conditional probability systems à la Battigalli, P., and M. Siniscalchi. 1999. “Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games.” Journal of Economic Theory 88: 188–230. We prove two independent generalizations of the agreement theorem, one where the agents share some common conditioning event, and one where they may not.
Proof of Proposition 1.
First of all observe that covers , since is a partition of . Then, consider an arbitrary collection of positive reals such that . For each define
Verifying that is a probability measure in is trivial. Moreover, notice that for every and every with , it is the case that
with eq. (10) following from since either or .
Proof of Theorem 1.
Define , which is by hypothesis nonempty. Since the event is measurable with respect to the partition , either or . Now, for an arbitrary , it is necessarily the case that . Hence, for each ,
The second equality follows from , which is by definition true for all . Now, define the set . Hence,
Finally, since does not depend on , it is the case that .
Proof of Theorem 2.
Step 1. Define , which is by hypothesis nonempty. Then, define the set . Then, following Tsakas and Voorneveld (2011), Proof of Lemma, we define as the coarsest partition of that generates , i.e., formally for every , the element of that contains is defined by . Thus, we obtain
with eq. (11) following from the fact that is balanced. Before moving forward, let us point out that or might in principle be equal to 0 for some or respectively. In such cases, the conditional probabilities given these null events take arbitrary values.
Step 2. Now, similarly to the proof of Theorem 1, it is the case that for all , thus implying for all and all .
Step 3. Now take an arbitrary such that . Then, there exists some such that , and therefore since is a common prior, we obtain for all with . Hence, by eq. (12) it follows that
with eq. (13) following again from the fact that is balanced. Indeed, the conditional probability can be seen as an indicator function, with if and otherwise. Finally, notice that does not depend on , thus completing the proof.
Alós-Ferrer, C., and Ritzberger K. 2016. The Theory of Extensive Form Games. Springer. Search in Google Scholar
Bonanno, G., and Nehring K. 1997. “Agreeing to Disagree: A Survey.” Working Paper, UC Davis. Search in Google Scholar
Bonanno, G., and Nehring K. 1999. “How to Make Sense of the Common Prior Assumption Under Incomplete Information.” International Journal of Game Theory 28: 409–434.10.1007/s001820050117 Search in Google Scholar
Battigalli, P., and Siniscalchi M. 1999. “Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games.” Journal of Economic Theory 88: 188–230.10.1006/jeth.1999.2555 Search in Google Scholar
Brandenburger, A., Friedenberg A., and Keissler H.J. 2007. “Notes on the Relationship Between Strong Belief and Assumption.” Unpublished manuscript. Search in Google Scholar
Geanakoplos, J. 1989. “Game Theory Without Partitions, and Applications to Speculation and Consensus.” Cowles Foundation Discussion Paper 914. Search in Google Scholar
Harsanyi, J. 1967-68. “Games with Incomplete Information Played by Bayesian Players, I-III.” Management Science 14: 159–182, 320–334, 486–502. Search in Google Scholar
Sebenius, J., and Geanakoplos J. 1983. “Don’t Bet on It: Contingent Agreements with Asymmetric Information.” Journal of the American Statistical Association 78: 424–426.10.1080/01621459.1983.10477988 Search in Google Scholar
Tsakas, E., and Voorneveld M. 2011. “On Consensus Through Communication Without a Commonly Known Protocol.” Journal of Mathematical Economics 47: 733–739.10.1016/j.jmateco.2011.10.003 Search in Google Scholar
I am indebted to three anonymous referees and the associate editor for their valuable comments. This note supersedes two previous papers by the same author, titled “Strong belief and agreeing to disagree” and “Hierarchies of conditional beliefs derived from commonly known priors” respectively.
© 2018 Walter de Gruyter GmbH, Berlin/Boston