暂无分享,去创建一个
[1] Boi Faltings,et al. Game Theory for Data Science: Eliciting Truthful Information , 2017, Game Theory for Data Science.
[2] A. Raftery,et al. Strictly Proper Scoring Rules, Prediction, and Estimation , 2007 .
[3] Rishabh K. Iyer,et al. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.
[4] Laura A. Dabbish,et al. Labeling images with a computer game , 2004, AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors.
[5] V. Shnayder,et al. Informed Truthfulness in MultiTask Peer Prediction ( Working paper ) , 2016 .
[6] Boi Faltings,et al. Incentives for Effort in Crowdsourcing Using the Peer Truth Serum , 2016, ACM Trans. Intell. Syst. Technol..
[7] Andreas Krause,et al. Selecting Sequences of Items via Submodular Maximization , 2017, AAAI.
[8] Andreas Krause,et al. Proper Proxy Scoring Rules , 2017, AAAI.
[9] Kevin Leyton-Brown,et al. Incentivizing Evaluation via Limited Access to Ground Truth: Peer-Prediction Makes Things Worse , 2016, ArXiv.
[10] David C. Parkes,et al. A Robust Bayesian Truth Serum for Small Populations , 2012, AAAI.
[11] Boi Faltings,et al. Incentive Mechanisms for Community Sensing , 2014, IEEE Transactions on Computers.
[12] Boi Faltings,et al. Incentives for Answering Hypothetical Questions , 2011 .
[13] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[14] Ryen W. White,et al. Stochastic Privacy , 2014, AAAI.
[15] Grant Schoenebeck,et al. G T ] 3 M ay 2 01 6 A Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling Yuqing Kong University of Michigan , 2016 .
[16] Yang Liu,et al. Learning to Incentivize: Eliciting Effort via Output Agreement , 2016, IJCAI.
[17] Anirban Dasgupta,et al. Crowdsourced judgement elicitation with endogenous proficiency , 2013, WWW.
[18] Nicole Immorlica,et al. A combinatorial allocation mechanism with penalties for banner advertising , 2008, WWW.
[19] Rishabh K. Iyer,et al. Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions , 2013, NIPS.
[20] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.
[21] David M. Pennock,et al. A Utility Framework for Bounded-Loss Market Makers , 2007, UAI.
[22] Andreas Krause,et al. Incentives for Privacy Tradeoff in Community Sensing , 2013, HCOMP.
[23] Jens Witkowski,et al. A Geometric Method to Construct Minimal Peer Prediction Mechanisms , 2016, AAAI.
[24] Yiling Chen,et al. Output Agreement Mechanisms and Common Knowledge , 2014, HCOMP.
[25] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[26] Andreas Krause,et al. Crowd Access Path Optimization: Diversity Matters , 2015, HCOMP.
[27] Boi Faltings,et al. A Robust Bayesian Truth Serum for Non-Binary Signals , 2013, AAAI.
[28] Paul Resnick,et al. Eliciting Informative Feedback: The Peer-Prediction Method , 2005, Manag. Sci..
[29] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[30] Aurélien Baillon,et al. Bayesian markets to elicit private information , 2017, Proceedings of the National Academy of Sciences.
[31] Andreas Krause,et al. Information Gathering in Networks via Active Exploration , 2015, IJCAI.
[32] Arpit Agarwal,et al. Informed Truthfulness in Multi-Task Peer Prediction , 2016, EC.
[33] Andreas Krause,et al. Submodularity and its applications in optimized information gathering , 2011, TIST.
[34] D. Prelec. A Bayesian Truth Serum for Subjective Data , 2004, Science.