Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing
Not on the map. Why?
Abstract (arXiv)
In mobile crowdsourcing (MCS), mobile users accomplish outsourced human intelligence tasks. MCS requires an appropriate task assignment strategy, since different workers may have different performance in terms of acceptance rate and quality. Task assignment is challenging, since a worker's performance (i) may fluctuate, depending on both the worker's current personal context and the task context, (ii) is not known a priori, but has to be learned over time. Moreover, learning context-specific worker performance requires access to context information, which may not be available at a central entity due to communication overhead or privacy concerns. Additionally, evaluating worker performance might require costly quality assessments. In this paper, we propose a context-aware hierarchical online learning algorithm addressing the problem of performance maximization in MCS. In our algorithm, a local controller (LC) in the mobile device of a worker regularly observes the worker's context, her/his decisions to accept or decline tasks and the quality in completing tasks. Based on these observations, the LC regularly estimates the worker's context-specific performance. The mobile crowdsourcing platform (MCSP) then selects workers based on performance estimates received from the LCs. This hierarchical approach enables the LCs to learn context-specific worker performance and it enables the MCSP to select suitable workers. In addition, our algorithm preserves worker context locally, and it keeps the number of required quality assessments low. We prove that our algorithm converges to the optimal task assignment strategy. Moreover, the algorithm outperforms simpler task assignment strategies in experiments based on synthetic and real data.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 3.
5 papers.
- 2022Federated Multi-Armed Bandits Under Byzantine Attackscited by 6
- 2021Socially-Optimal Mechanism Design for Incentivized Online Learningcited by 2
- 2023Diversity-Based Recruitment in Crowdsensing By Combinatorial Multi-Armed Banditscited by 1
- 2023A Semi-supervised Sensing Rate Learning based CMAB Scheme to Combat COVID-19 by Trustful Data Collection in the Crowdcited by 0
- 2023Incentivizing Massive Unknown Workers for Budget-Limited Crowdsensing: From Off-Line and On-Line Perspectivescited by 0
- 2023Diversity-Based Recruitment in Crowdsensing By Combinatorial Multi-Armed Bandits25 Dec 2023
- 2023Incentivizing Massive Unknown Workers for Budget-Limited Crowdsensing: From Off-Line and On-Line Perspectives21 Sep 2023
- 2023A Semi-supervised Sensing Rate Learning based CMAB Scheme to Combat COVID-19 by Trustful Data Collection in the Crowd17 Jan 2023
- 2022Federated Multi-Armed Bandits Under Byzantine Attacks9 May 2022
- 2021Socially-Optimal Mechanism Design for Incentivized Online Learning29 Dec 2021