Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

DOI10.1287/OPRE.2013.1235zbMATH Open1291.90115arXiv1110.3564OpenAlexW2163522723WikidataQ114368457 ScholiaQ114368457MaRDI QIDQ5166295FDOQ5166295

Authors: Sewoong Oh, Devavrat Shah, David R. Karger 

Publication date: 26 June 2014

Published in: Operations Research (Search for Journal in Brave)

Abstract: Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous "information piece-workers", have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofreading. Because these low-paid workers can be unreliable, nearly all such systems must devise schemes to increase confidence in their answers, typically by assigning each task multiple times and combining the answers in an appropriate manner, e.g. majority voting. In this paper, we consider a general model of such crowdsourcing tasks and pose the problem of minimizing the total price (i.e., number of task assignments) that must be paid to achieve a target overall reliability. We give a new algorithm for deciding which tasks to assign to which workers and for inferring correct answers from the workers' answers. We show that our algorithm, inspired by belief propagation and low-rank matrix approximation, significantly outperforms majority voting and, in fact, is optimal through comparison to an oracle that knows the reliability of every worker. Further, we compare our approach with a more general class of algorithms which can dynamically assign tasks. By adaptively deciding which questions to ask to the next arriving worker, one might hope to reduce uncertainty more efficiently. We show that, perhaps surprisingly, the minimum price necessary to achieve a target reliability scales in the same manner under both adaptive and non-adaptive scenarios. Hence, our non-adaptive approach is order-optimal under both scenarios. This strongly relies on the fact that workers are fleeting and can not be exploited. Therefore, architecturally, our results suggest that building a reliable worker-reputation system is essential to fully harnessing the potential of adaptive designs.

Full work available at URL: https://arxiv.org/abs/1110.3564

Recommendations

• Bandit-based task assignment for heterogeneous crowdsourcing
• Task design in complex crowdsourcing experiments: item assignment optimization
• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• Bayesian methods for intelligent task assignment in crowdsourcing systems

zbMATH Keywords

estimationinformation systems

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Cited In (20)

• More for less: adaptive labeling payments in online labor markets
• Parametric Prediction from Parametric Agents
• Towards optimal estimation of bivariate isotonic matrices with unknown permutations
• Task design in complex crowdsourcing experiments: item assignment optimization
• Title not available (Why is that?)
• Crowdvoting Judgment: An Analysis of Modern Peer Review
• On improved interval cover mechanisms for crowdsourcing markets
• Title not available (Why is that?)
• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• Product design crowdsourcing in a dual‐channel supply chain: joint reviews from manufacturer and consumers
• Title not available (Why is that?)
• Verifiable crowd computing: coping with bounded rationality
• POMDP-based control of workflows for crowdsourcing
• Optimal pricing of crowdsourcing logistics services with social delivery capacity
• On the efficiency of data collection for multiple naïve Bayes classifiers
• A branch-cut-and-price algorithm for optimal decoding in digital communication systems
• BUDGET ALLOCATIONS IN OPERATIONAL RISK MANAGEMENT
• On the Capacity of Information Processing Systems
• Who should cast the casting vote? Using sequential voting to amalgamate information
• Adaptive Matching for Expert Systems with Uncertain Task Types

This page was built for publication: Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166295)