PBSM: Predictive Bi-Preference Stable Matching in Spatial Crowdsourcing

Page view(s)
0
Checked on
PBSM: Predictive Bi-Preference Stable Matching in Spatial Crowdsourcing
Title:
PBSM: Predictive Bi-Preference Stable Matching in Spatial Crowdsourcing
Journal Title:
2025 IEEE 41st International Conference on Data Engineering (ICDE)
Keywords:
Publication Date:
20 August 2025
Citation:
Xie, Y., Liu, Y., Zhou, X., Yin, Y., Li, K., & Zimmermann, R. (2025). PBSM: Predictive Bi-Preference Stable Matching in Spatial Crowdsourcing. 2025 IEEE 41st International Conference on Data Engineering (ICDE), 765–778. https://doi.org/10.1109/icde65448.2025.00063
Abstract:
Task assignment is a fundamental challenge in Spatial Crowdsourcing which aims to assign location-based tasks to workers under spatial-temporal constraints. Recently, some exciting research has introduced the preference of workers and tasks to improve assignment quality. However, they either primarily focus on the current preferences of both workers and tasks or only consider the unilateral prediction-based preference of workers, overlooking the impact of workers' interconnection and tasks' completed sequences. As a result, they gain suboptimal assignment results in most cases. Inspired by this, we propose a novel problem, named the Predictive Bi-preference Stable Match problem (PBSM), with the goal of maximizing the preferences of both workers and tasks by taking into account the social network of workers and task completion sequence. The PBSM problem is proven to be NP-hard. To tackle this challenging problem, we develop a GCN-enhanced Transformer-based Prediction and Bi-preference Stable Matching (GETBM) framework with two stages: the bi-preference prediction stage and the bilateral assignment stage. In the prediction stage, the Worker Preference Model (WPM) and Task Preference Model (TPM) models are presented to predict the worker-to-task (Worker2Task) and task-to-worker (Task2Worker) preference lists, respectively. Then, we design a bilateral preference-aware stable matching (BPM) algorithm and prove it can gain stable results. To generalize to multiple scenarios, three optimization strategies are devised based on spatial-temporal constraints and priority consideration to gain better assignment performance. Extensive experiments are conducted to prove the superiority of the GETBM framework on two real datasets.
License type:
Publisher Copyright
Funding Info:
This research / project is supported by the Ministry of Education of Singapore (MOE). - Singapore Ministry of Education Academic Research Fund Tier 2
Grant Reference no. : T2EP20221-0023

the Creative Research Groups Program of the National Natural Science Foundation of China

the National Natural Science Foundation of China.

the Natural Science Foundation of Hunan Province

the Key R&D Program of Hunan Province
Description:
© 2025 IEEE.  Personal use of this material is permitted.  Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
ISSN:
2375-026X
Files uploaded:

File Size Format Action
pbsm-main.pdf 3.98 MB PDF Request a copy