Bayesian experts who are exposed to different evidence often make contradictory probabilistic forecasts. An aggregator, ignorant of the underlying model, uses this to calculate his or her own forecast. We use the notions of scoring rules and regret to propose a natural way to evaluate an aggregation scheme. We focus on a binary state space and construct low regret aggregation schemes whenever there are only two experts that either are Blackwell-ordered or receive conditionally independent and identically distributed (i.i.d.) signals. In contrast, if there are many experts with conditionally i.i.d. signals, then no scheme performs (asymptotically) better than a (0.5, 0.5) forecast.
|Journal||Proceedings of the National Academy of Sciences of the United States of America|
|State||Published - 26 Dec 2018|
- Blackwell-ordered information structure
- Conditionally independent information structure
- Information aggregation
- One-shot regret minimization
All Science Journal Classification (ASJC) codes