{
  "id": "1912.00126",
  "version": "v1",
  "published": "2019-11-30T03:57:06.000Z",
  "updated": "2019-11-30T03:57:06.000Z",
  "title": "Contradictory predictions",
  "authors": [
    "Krzysztof Burdzy",
    "Soumik Pal"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "We prove the sharp bound for the probability that two experts who have access to different information, represented by different $\\sigma$-fields, will give radically different estimates of the probability of an event. This is relevant when one combines predictions from various experts in a common probability space to obtain an aggregated forecast. Our proof is constructive in the sense that, not only the sharp bounds are proved, but also the optimizer is constructed via an explicit algorithm.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-11-30T03:57:06.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60E15"
    ],
    "keywords": [
      "contradictory predictions",
      "sharp bound",
      "common probability space",
      "explicit algorithm",
      "information"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}