User:IssaRice/Aumann's agreement theorem: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 21: Line 21:
! 2
! 2
|}
|}
<math>E = \{\omega \in \Omega : \Pr(A \mid I(\omega)) = q_1 \text{ and } \Pr(A \mid J(\omega)) = q_2\}</math>


<ref>Tyrrell McAllister. [https://web.archive.org/web/20110725162431/http://dl.dropbox.com/u/34639481/Aumann_agreement_theorem.pdf "Aumann's agreement theorem"]. July 7, 2011.</ref>
<ref>Tyrrell McAllister. [https://web.archive.org/web/20110725162431/http://dl.dropbox.com/u/34639481/Aumann_agreement_theorem.pdf "Aumann's agreement theorem"]. July 7, 2011.</ref>

Revision as of 21:33, 24 August 2018

Hal Finney's example

123456123456723456783456789456789105678910116789101112

1 2 3 4 5 6
1
2

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

[1]

[2]

[3]

[4]

[5]

References

  1. ↑ Tyrrell McAllister. "Aumann's agreement theorem". July 7, 2011.
  2. ↑ Wei Dai. "Probability Space & Aumann Agreement". December 10, 2009.
  3. ↑ Robert J. Aumann. "Agreeing to Disagree". November 1976.
  4. ↑ https://math.stackexchange.com/questions/303834/common-knowledge-and-concept-of-coarsening-partition
  5. ↑ John Geanakoplos. "Common Knowledge".
Retrieved from "https://machinelearning.subwiki.org/w/index.php?title=User:IssaRice/Aumann%27s_agreement_theorem&oldid=604"