Scalable algorithms for aggregating disparate forecasts of probability
Abstract
J. B. Predd S. R. Kulkarni H. V. Poor D. N. Osherson Department of Electrical Engineering Department of Psychology Princeton University Princeton University Princeton, NJ 08544 Princeton, NJ 08544 {jpredd,kulkarni,poor}@princeton.edu [email protected]Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Aggregating Large Sets of Probabilistic Forecasts by Weighted Coherent Adjustment.Guanchun Wang, Sanjeev R. Kulkarni & Daniel N. Osherson - unknown
The Princeton Papyri Allan Chester Johnson and Sidney Pullman Goodrich: Papyri in the Princeton University Collections, Vol. III. Pp. xii+124. Princeton: Princeton University Press (London: Milford), 1942. Cloth, $3. [REVIEW]H. I. Bell - 1943 - The Classical Review 57 (02):81-82.
Probabilistic coherence and proper scoring rules.Joel Predd, Robert Seiringer, Elliott Lieb, Daniel Osherson, H. Vincent Poor & Sanjeev Kulkarni - 2009 - IEEE Transactions on Information Theory 55 (10):4786-4792.
Analytics
Added to PP
2009-01-28
Downloads
21 (#543,015)
6 months
1 (#449,220)
2009-01-28
Downloads
21 (#543,015)
6 months
1 (#449,220)
Historical graph of downloads
References found in this work
The conjunction fallacy: a misunderstanding about conjunction?Daniel Osherson - 2004 - Cognitive Science 28 (3):467-477.
