Capability-Aware Fair Complex Task Assignment in Spatial Crowdsourcing
Xiu FANG , Tiancheng ZHU , Yuqiong YI , Xinwei HUANG , Guohao SUN
Journal of Donghua University(English Edition) ›› 2026, Vol. 43 ›› Issue (5) : 112 -120.
Spatial crowdsourcing (SC) requires efficient task assignment algorithms, particularly for complex tasks requiring sequential completion. Despite extensive research on complex task assignments, most studies overlook the importance of fairness and the worker capability, leading to resource wastage. Fairness means ensuring that each worker is treated justly in the task assignment process. The worker capability refers to the maximum number of tasks that they can complete. This paper defines a capability-aware fair complex task assignment (CAFCTA) problem in SC, aiming to maximize the number of completed tasks, the total utility of workers, and capability-aware fairness under worker capability, task dependency, and time constraints. To effectively address the CAFCTA problem, we propose two algorithms: a fast assignment algorithm using a greedy strategy to match tasks to the most suitable workers quickly; an enhanced greedy algorithm with simulated annealing (SA), introducing a random search mechanism to avoid local optima. Experimental results demonstrate the effectiveness and efficiency of our algorithms.
spatial crowdsourcing (SC) / task assignment / fairness / NP-hardness / greedy strategy / simulated annealing
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
Dang H, Nguyen T, |
| [17] |
|
| [18] |
|
| [19] |
Liu Q, Abdessalem T, Wu H Y, |
| [20] |
|
| [21] |
Cheng P, Lian X, Chen L, |
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
/
| 〈 |
|
〉 |