众包
计算机科学
激励
一致性(知识库)
任务(项目管理)
分级(工程)
多样性(控制论)
数据科学
人工智能
万维网
土木工程
管理
工程类
经济
微观经济学
作者
Goran Radanović,Boi Faltings,Radu Jurca
出处
期刊:ACM Transactions on Intelligent Systems and Technology
[Association for Computing Machinery]
日期:2016-03-31
卷期号:7 (4): 1-28
被引量:97
摘要
Crowdsourcing is widely proposed as a method to solve a large variety of judgment tasks, such as classifying website content, peer grading in online courses, or collecting real-world data. As the data reported by workers cannot be verified, there is a tendency to report random data without actually solving the task. This can be countered by making the reward for an answer depend on its consistency with answers given by other workers, an approach called peer consistency . However, it is obvious that the best strategy in such schemes is for all workers to report the same answer without solving the task. Dasgupta and Ghosh [2013] show that, in some cases, exerting high effort can be encouraged in the highest-paying equilibrium. In this article, we present a general mechanism that implements this idea and is applicable to most crowdsourcing settings. Furthermore, we experimentally test the novel mechanism, and validate its theoretical properties.
科研通智能强力驱动
Strongly Powered by AbleSci AI