arXiv Analytics

Sign in

arXiv:1912.00126 [math.PR]AbstractReferencesReviewsResources

Contradictory predictions

Krzysztof Burdzy, Soumik Pal

Published 2019-11-30Version 1

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.

Related articles: Most relevant | Search more
arXiv:1709.02416 [math.PR] (Published 2017-09-07)
A sharp bound for winning within a proportion of the maximum of a sequence
arXiv:1506.04263 [math.PR] (Published 2015-06-13)
Necessity of Future Information in Admission Control
arXiv:1211.0618 [math.PR] (Published 2012-11-03, updated 2014-07-02)
Queuing with future information