TY - JOUR
T1 - Aggregative Online Task Assignment in Spatial Crowdsourcing
T2 - An Auction-aware Approach
AU - Zhu, Guanglei
AU - Li, Yafei
AU - Du, Shuaiqi
AU - Xu, Jianliang
AU - Ding, Shaojie
AU - Xu, Mingliang
N1 - This work is supported by the following grants: NSFC Grants 62372416, 62325602, 62036010 and 62402453; HNSF Grant 242300421215; Guangdong Basic and Applied Basic Research Foundation (Project No. 2023B1515130002).
Publisher Copyright:
© 2025 IEEE.
PY - 2025/10/13
Y1 - 2025/10/13
N2 - Spatial crowdsourcing (SC) services, such as ridesharing and food delivery, are increasingly shaping people's daily lives. A key issue in SC is online task assignment, which involves assigning tasks to appropriate workers in real time. Most existing studies focus on task assignment within independent platforms but still face the limitation of spatial-temporal imbalance between tasks and workers. Recently, aggregation platforms (e.g., AMap's ride-hailing) have emerged, enabling tasks to be completed by workers from multiple cooperating platforms. However, effectively incentivizing these cooperating platforms to deliver high-quality services remains an open challenge. In this paper, we study a novel Aggregative Online Task Assignment (AOTA) problem, where the aggregation platform assigns tasks to suitable cooperating providers with the goal of maximizing overall quality-aware social welfare. To address the AOTA problem, we design an efficient Context-aware Online Bidding Task Assignment (COBTA) framework, which integrates a reverse sealed Vickrey auction to promote truthful bidding for public tasks among platforms. COBTA employs an exploration-exploitation strategy for efficient and effective public task assignment and leverages a multi-agent reinforcement learning method to enable cooperating platforms to make adaptive bid-or-not decisions based on their internal status. Extensive experiments on three real-world datasets validate the effectiveness and efficiency of our proposed solution.
AB - Spatial crowdsourcing (SC) services, such as ridesharing and food delivery, are increasingly shaping people's daily lives. A key issue in SC is online task assignment, which involves assigning tasks to appropriate workers in real time. Most existing studies focus on task assignment within independent platforms but still face the limitation of spatial-temporal imbalance between tasks and workers. Recently, aggregation platforms (e.g., AMap's ride-hailing) have emerged, enabling tasks to be completed by workers from multiple cooperating platforms. However, effectively incentivizing these cooperating platforms to deliver high-quality services remains an open challenge. In this paper, we study a novel Aggregative Online Task Assignment (AOTA) problem, where the aggregation platform assigns tasks to suitable cooperating providers with the goal of maximizing overall quality-aware social welfare. To address the AOTA problem, we design an efficient Context-aware Online Bidding Task Assignment (COBTA) framework, which integrates a reverse sealed Vickrey auction to promote truthful bidding for public tasks among platforms. COBTA employs an exploration-exploitation strategy for efficient and effective public task assignment and leverages a multi-agent reinforcement learning method to enable cooperating platforms to make adaptive bid-or-not decisions based on their internal status. Extensive experiments on three real-world datasets validate the effectiveness and efficiency of our proposed solution.
KW - aggregation mode
KW - auction model
KW - Location-based services
KW - spatial crowdsourcing
KW - task assignment
UR - https://www.scopus.com/pages/publications/105018763107
U2 - 10.1109/TMC.2025.3620587
DO - 10.1109/TMC.2025.3620587
M3 - Journal article
AN - SCOPUS:105018763107
SN - 1536-1233
VL - 25
SP - 3998
EP - 4012
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 3
ER -