Probabilistic Opinion Pooling Generalized. Part One: General Agendas

Social Choice and Welfare 48:747–786 (2017)
Download Edit this record How to cite View on PhilPapers
How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain or an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory.
PhilPapers/Archive ID
Revision history
First archival date: 2017-04-30
Latest version: 2 (2020-04-21)
View upload history
References found in this work BETA
Arrow's Theorem in Judgment Aggregation.Dietrich, Franz & List, Christian
Logical Constraints on Judgement Aggregation.Pauly, Marc & van Hees, Martin
Probabilistic Opinion Pooling.Dietrich, Franz & List, Christian

View all 25 references / Add more references

Citations of this work BETA
Aggregating Causal Judgments.Bradley, Richard; Dietrich, Franz & List, Christian

View all 12 citations / Add more citations

Added to PP index

Total views
246 ( #18,106 of 50,231 )

Recent downloads (6 months)
28 ( #22,141 of 50,231 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.