TY - GEN
T1 - Online Crowd Learning with Heterogeneous Workers via Majority Voting
AU - Huang, Chao
AU - Yu, Haoran
AU - Huang, Jianwei
AU - Berry, Randall A.
N1 - Funding Information:
Chao Huang is with the Department of Information Engineering, the Chinese University of Hong Kong. Email: [email protected]. Haoran Yu is with the School of Computer Science, Beijing Institute of Technology. Email: [email protected]. Jianwei Huang is with the School of Science and Engineering at the Chinese University of Hong Kong, Shenzhen, the Shenzhen Institute of Artificial Intelligence and Robotics for Society, and the Department of Information Engineering at the Chinese University of Hong Kong. Email: [email protected]. Randall A Berry is with Department of Electrical and Computer Engineering, Northwestern University. Email: [email protected]. This work is supported by the Shenzhen Institute of Artificial Intelligence and Robotics for Society, the General Research Fund CUHK 14219016 from Hong Kong UGC, and the Presidential Fund from the Chinese University of Hong Kong, Shenzhen.
Publisher Copyright:
© 2020 International Federation for Information Processing (IFIP).
PY - 2020/6
Y1 - 2020/6
N2 - Many platforms recruit workers through crowd-sourcing to finish online tasks involving a huge amount of effort (e.g., image labeling and content moderation). These platforms aim to incentivize heterogeneous workers to exert effort finishing the tasks and truthfully report their solutions. When the verification for the workers' solutions is absent, the crowdsourcing problem is challenging and is known as information elicitation without verification (IEWV). Majority voting is a common approach to solve an IEWV problem, where a worker is rewarded based on whether his solution is consistent with the majority. However, most prior related work relies on a strong assumption that workers' solution accuracy levels are public knowledge. We relax such an assumption and propose an online learning mechanism based on majority voting, which allows the platform to learn the distribution of the workers' solution accuracy levels. In the mechanism, workers will be asked to report their private accuracy levels (which do not need to be the true values), in addition to deciding their effort levels and solution reporting strategies. The mechanism computes the workers' rewards based on their reported accuracy levels, and the workers obtain rewards if their reported solutions match the majority. We show that our mechanism induces workers to truthfully report their solution accuracy levels in the long run, in which the platform asymptotically achieves zero regret. Moreover, we show that our online mechanism converges faster when the workers are more capable of solving the tasks.
AB - Many platforms recruit workers through crowd-sourcing to finish online tasks involving a huge amount of effort (e.g., image labeling and content moderation). These platforms aim to incentivize heterogeneous workers to exert effort finishing the tasks and truthfully report their solutions. When the verification for the workers' solutions is absent, the crowdsourcing problem is challenging and is known as information elicitation without verification (IEWV). Majority voting is a common approach to solve an IEWV problem, where a worker is rewarded based on whether his solution is consistent with the majority. However, most prior related work relies on a strong assumption that workers' solution accuracy levels are public knowledge. We relax such an assumption and propose an online learning mechanism based on majority voting, which allows the platform to learn the distribution of the workers' solution accuracy levels. In the mechanism, workers will be asked to report their private accuracy levels (which do not need to be the true values), in addition to deciding their effort levels and solution reporting strategies. The mechanism computes the workers' rewards based on their reported accuracy levels, and the workers obtain rewards if their reported solutions match the majority. We show that our mechanism induces workers to truthfully report their solution accuracy levels in the long run, in which the platform asymptotically achieves zero regret. Moreover, we show that our online mechanism converges faster when the workers are more capable of solving the tasks.
UR - http://www.scopus.com/inward/record.url?scp=85091773717&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091773717&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85091773717
T3 - 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOPT 2020
BT - 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOPT 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOPT 2020
Y2 - 15 June 2020 through 19 June 2020
ER -