Name
Abstract | ||
|---|---|---|
AbstractIn recent years, mobile crowdsourcing has emerged as a powerful computation paradigm to harness human power to perform spatial tasks such as collecting real-time traffic information and checking product prices in a specific supermarket. A fundamental problem of mobile crowdsourcing is: When both tasks and crowd workers appear in the platforms dynamically, how to assign an appropriate set of tasks to each worker. Most existing studies focus on efficient assignment algorithms based on bipartite graph matching. However, they overlook an important fact that crowd workers might be unreliable. Thus, their task assignment schemes cannot ensure the overall quality. In this article, we investigate the Quality-aware Online Task Assignment (QAOTA) problem in mobile crowdsourcing. We propose a probabilistic model to measure the quality of tasks and a hitchhiking model to characterize workers’ behavior patterns. We model task assignment as a quality maximization problem and derive a polynomial-time online assignment algorithm. Through rigorous analysis, we prove that the proposed algorithm approximates the offline optimal solution with a competitive ratio of 10/7. Finally, we demonstrate the efficiency and effectiveness of our solution through intensive experiments. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3397180 | ACM Transactions on Sensor Networks |
Keywords | DocType | Volume |
Crowdsourcing, task assignment | Journal | 16 |
Issue | ISSN | Citations |
3 | 1550-4859 | 1 |
PageRank | References | Authors |
0.35 | 0 | 5 |