Fetching the paper…
Reading the bibliography…
Strictly proper scoring rules (SPSR) are incentive compatible for eliciting information about random variables from strategic agents when the principal can reward agents after the realization of the random variables.
Verification of forecasts expressed in terms of probability
Glenn W Brier. 1950 · 1950
Earlier work this paper cites.
Measures of the Value of Information
John McCarthy. 1956 · 1956
Earlier work this paper cites.
Scoring rules and the evaluation of probability assessors
Robert L. Winkler. 1969 · 1969
Earlier work this paper cites.
Elicitation of Personal Probabilities and Expectations
Leonard J. Savage. 1971 · 1971
Earlier work this paper cites.
Learning from noisy examples
Dana Angluin and Philip Laird. 1988 · 1988
Earlier work this paper cites.
Learning linear threshold functions in the presence of classification noise. In Proceedings of the seventh annual conference on Computational learning theory . ACM, 340–347
Tom Bylander. 1994 · 1994
Earlier work this paper cites.
A Bayesian Truth Serum for Subjective Data
Dražen Prelec. 2004 · 2004
Earlier work this paper cites.
Eliciting Informative Feedback: The Peer-Prediction Method
Nolan Miller, Paul Resnick, and Richard Zeckhauser. 2005 · 2005
Earlier work this paper cites.
Scoring Rules, Generalized Entropy and utility maximization. (2006)
Victor Richmond Jose, Robert F. Nau, and Robert L. Winkler. 2006 · 2006
Earlier work this paper cites.
Strictly Proper Scoring Rules, Prediction, and Estimation
Tilmann Gneiting and Adrian E. Raftery. 2007 · 2007
Earlier work this paper cites.
A Robust Bayesian Truth Serum for Small Populations. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI ’12)
Jens Witkowski and David C. Parkes. 2012 · 2012
Earlier work this paper cites.
Crowdsourced judgement elicitation with endogenous proficiency. In Proceedings of the 22nd international conference on World Wide Web . 319–330
Anirban Dasgupta and Arpita Ghosh. 2013 · 2013
Earlier work this paper cites.
Learning with noisy labels. In Advances in neural information processing systems . 1196–1204
Nagarajan Natarajan, Inderjit S Dhillon, Pradeep K Ravikumar, and Ambuj Tewari. 2013 · 2013
Cited alongside, same era.
A Robust Bayesian Truth Serum for Non-Binary Signals. In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI ’13)
Goran Radanovic and Boi Faltings. 2013 · 2013
Cited alongside, same era.
Classification with Asymmetric Label Noise: Consistency and Maximal Denoising.. In COLT . 489–511
Clayton Scott, Gilles Blanchard, Gregory Handy, Sara Pozzi, and Marek Flaska. 2013 · 2013
Cited alongside, same era.
Dwelling on the Negative: Incentivizing Effort in Peer Prediction. In HCOMP’13
Jens Witkowski, Yoram Bachrach, Peter Key, and David C. Parkes. 2013 · 2013
Cited alongside, same era.
Classification in the presence of label noise: a survey
Benoît Frénay and Michel Verleysen. 2014 · 2014
Cited alongside, same era.
Equilibrium selection in information elicitation without verification via information monotonicity
Yuqing Kong and Grant Schoenebeck. 2016 · 2016
Later among the works it cites.
Linear scoring rules for probabilistic binary classification
Matthew Parry et al · 2016
Later among the works it cites.
Incentives for effort in crowdsourcing using the peer truth serum
Goran Radanovic, Boi Faltings, and Radu Jurca. 2016 · 2016
Later among the works it cites.
Informed truthfulness in multi-task peer prediction. In Proceedings of the 2016 ACM Conference on Economics and Computation . ACM, 179–196
Victor Shnayder, Arpit Agarwal, Rafael Frongillo, and David C Parkes. 2016 · 2016
Later among the works it cites.
A solution to the single-question crowd wisdom problem
Dražen Prelec, H Sebastian Seung, and John McCoy. 2017 · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An Online Learning Approach to Improving the Quality of Crowd-Sourcing. In Proceedings of the 2015 ACM SIGMETRICS . ACM, New York, NY, USA, 217–230
Yang Liu and Mingyan Liu. 2015 · 2015
Cited alongside, same era.
Learning from corrupted binary labels via class-probability estimation. In International Conference on Machine Learning . 125–134
Aditya Menon, Brendan Van Rooyen, Cheng Soon Ong, and Bob Williamson. 2015 · 2015
Cited alongside, same era.
A Rate of Convergence for Mixture Proportion Estimation, with Application to Learning from Noisy Labels.. In AISTATS
Clayton Scott. 2015 · 2015
Cited alongside, same era.
Learning in the Presence of Corruption
Brendan van Rooyen and Robert C Williamson. 2015 · 2015
Cited alongside, same era.
Distilling the wisdom of crowds: Prediction markets vs. prediction polls
Pavel Atanasov, Phillip Rescober, Eric Stone, Samuel A Swift, Emile Servan-Schreiber, Philip Tetlock, Lyle Ungar, and Barbara Mellers. 2016 · 2016
Cited alongside, same era.
Incentives for truthful peer grading
Luca De Alfaro, Michael Shavlovsky, and Vassilis Polychronopoulos. 2016 · 2016
Cited alongside, same era.
Incentivizing evaluation via limited access to ground truth: Peer-prediction makes things worse
Alice Gao, James R Wright, and Kevin Leyton-Brown. 2016 · 2016
Cited alongside, same era.
Proper proxy scoring rules. In Thirty-First AAAI Conference on Artificial Intelligence
Jens Witkowski, Pavel Atanasov, Lyle H Ungar, and Andreas Krause. 2017 · 2017
Later among the works it cites.
Deep Bayesian Trust : A Dominant and Fair Incentive Mechanism for Crowd
Naman Goel and Boi Faltings. 2018 · 2018
Closest in time.
Water from two rocks: Maximizing the mutual information. In Proceedings of the 2018 ACM Conference on Economics and Computation . 177–194
Yuqing Kong and Grant Schoenebeck. 2018 · 2018
Closest in time.
Quantifying information and uncertainty
Alexander Frankel and Emir Kamenica. 2019 · 2019
Closest in time.
Hybrid Forecasting Competition
IARPA. 2019 · 2019
Closest in time.
An information theoretic framework for designing information elicitation mechanisms that reward truth-telling
Yuqing Kong and Grant Schoenebeck. 2019 · 2019
Closest in time.
Dominantly Truthful Multi-task Peer Prediction with a Constant Number of Tasks. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM, 2398–2411
Yuqing Kong. 2020 · 2020
Closest in time.