User:IssaRice/Aumann's agreement theorem

From Machinelearning

Hal Finney's example

123456123456723456783456789456789105678910116789101112

1 2 3 4 5 6
1
2

E={ω∈Ω:Pr(A∣I(ω))=q1 and Pr(A∣J(ω))=q2}

One of the assumptions in the agreement theorem is that E is common knowledge. This seems like a pretty strange requirement, since it seems like the posterior probability of A can never change no matter what else the agents condition on in addition to E. For example, what if we bring in agent 3 and make the posteriors common knowledge again?

What if we take E′={ω∈Ω:Pr(A∣I(ω))=q1} and say that agent 1 knows E′?

In the form of E above, we can change A to be any subset of Ω and q1,q2 to be any numbers in [0,1]. We can also set the state of the world to be any ω∈Ω. The agreement theorem says that as we vary these parameters, if we ever find that (I∧J)(ω)⊂E, then we must have q1=q2.

[1]

[2]

[3]

[4]

[5]

References