LGDBMar 27, 2025

DATA-WA: Demand-based Adaptive Task Assignment with Dynamic Worker Availability Windows

arXiv:2503.21458v13 citationsh-index: 12ICDE
Originality Incremental advance
AI Analysis

This addresses the challenge of fluctuating demand and supply in spatial crowdsourcing for mobile workers, representing an incremental improvement over static assignment methods.

The paper tackles the problem of spatial crowdsourcing by introducing an adaptive task assignment framework that maximizes assigned tasks by dynamically adjusting assignments based on predicted demand and worker availability, with experiments on real data showing effectiveness and efficiency.

With the rapid advancement of mobile networks and the widespread use of mobile devices, spatial crowdsourcing, which involves assigning location-based tasks to mobile workers, has gained significant attention. However, most existing research focuses on task assignment at the current moment, overlooking the fluctuating demand and supply between tasks and workers over time. To address this issue, we introduce an adaptive task assignment problem, which aims to maximize the number of assigned tasks by dynamically adjusting task assignments in response to changing demand and supply. We develop a spatial crowdsourcing framework, namely demand-based adaptive task assignment with dynamic worker availability windows, which consists of two components including task demand prediction and task assignment. In the first component, we construct a graph adjacency matrix representing the demand dependency relationships in different regions and employ a multivariate time series learning approach to predict future task demands. In the task assignment component, we adjust tasks to workers based on these predictions, worker availability windows, and the current task assignments, where each worker has an availability window that indicates the time periods they are available for task assignments. To reduce the search space of task assignments and be efficient, we propose a worker dependency separation approach based on graph partition and a task value function with reinforcement learning. Experiments on real data demonstrate that our proposals are both effective and efficient.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes