In a series of posts a few months ago (here, here, and here), I explored a particular method by which we might aggregate expert credences...
- Repository URL:
- Most Recent Tweet View All Tweets
- Most Recent Blog Mention
Suppose several individuals (e.g., experts on a panel) each assign probabilities to some events. How can these individual probability assignments be aggregated into a single collective probability assignment? This article reviews several proposed solutions to this problem. We focus on three salient proposals: linear pooling (the weighted or unweighted linear averaging of probabilities), geometric pooling (the weighted or unweighted geometric averaging of probabilities), and multiplicative pooling (where probabilities are multiplied rather than averaged). We present axiomatic characterisations of each class of pooling functions (most of them classic, but one new) and argue that linear pooling can be justified "procedurally" but not "epistemically", while the other two pooling methods can be justified "epistemically". The choice between them, in turn, depends on whether the individuals' probability assignments are based on shared information or on private information. We conclude by mentioning a number of other pooling methods.