Opinion pooling on general agendas
How can different individualsâ€™ probability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the â€˜agendaâ€™of relevant events forms a -algebra, an overly demanding assumption for many practical applications. We drop this assumption and explore probabilistic opinion pooling on general agendas. Our main theorems characterize linear pooling and neutral pooling for large classes of agendas, with standard results as special cases.
|Date of creation:||May 2008|
|Contact details of provider:|| Postal: LSE Library Portugal Street London, WC2A 2HD, U.K.|
Phone: +44 (020) 7405 7686
Web page: http://www.lse.ac.uk/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ehl:lserod:20127. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (LSERO Manager)
If references are entirely missing, you can add them using this form.