arrow
Return

Fairness-Guaranteed Task Assignment for Crowdsourced Mobility Services

delete2024-05-01
delete0
PRE
AI
Y
Yafei Li
H
Huiling Li
B
Baolong Mei
X
Xin Huang
J
Jianliang Xu *
徐明亮 cover
徐明亮 (Mingliang Xu) *
DOI:10.1109/TMC.2023.3310591delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
As a new computing paradigm, crowdsourced mobility service is booming with the rapid development of sharing economy. In the typical crowdsourced mobility service, a large number of part-time workers perform the spatial tasks offered by the platform and share the benefits in proportion, thereby, the strategy of task assignment directly affects the level of revenue and fairness among workers. In order to balance the revenue and fairness of workers, in this paper we study a novel type of fairness-aware spatial crowdsourcing problem, namely Fairness-Guaranteed Task Assignment (FGTA), which aims to maximize the total revenue of workers at a certain level of fairness guarantee and that is proved to be NP-hard. To solve this problem, we propose an efficient game-theory based approach for task assignment, which makes use of the best-response framework to iteratively select the best strategy for each worker until a Nash equilibrium is reached. Inspired by the observation that tasks with similar spatial and temporal features can be assigned together to a worker, we propose a spatial-temporal grouping based optimization to further improve the efficiency of task assignment. Furthermore, to improve the quality of Nash equilibrium, we present an effective large neighborhood search based optimization that trains a DQN decision model as destroy operator to accelerate the convergence of optimal task assignment. Finally, extensive experiments conducted on two real-world datasets demonstrate that our proposed approaches achieve better effectiveness and efficiency than the state-of-the-arts.
Keywords:
Task analysis
Mobile computing
Shared transport
Roads
Optimization
Schedules
Real-time systems
Crowdsourced mobility services
fairness
game theory
reinforcement learning
task assignment

Journal

IEEE Transactions on Mobile Computing cover
IEEE Transactions on Mobile Computing
IF:
9.2
Papers:
5.9K
Citations:
1.8W

Organization

Z
Zhengzhou University
Scholars:
6.8W
Papers: 4.4W
Citations: 8.5W
Cited Papers

Cited Papers

Laparoscopic approach in emergency for the treatment of acute incarcerated groin hernia: a systematic review and meta-analysis
err2022-05-26
err0
PREAI
errA. Sartori; A. Balla; E. Botteri; F. Scolari; M. Podda; P. Lepiane; M. Guerrieri; S. Morales-Conde; A. Szold; M. Ortenzi
errShare
errSave
errShare
errSave
Laparoscopic versus open repair of perforated peptic ulcers: analysis of outcomes and identification of predictive factors of conversion
err2022-10-03
err0
errOAAI
errDario Tartaglia; Silvia Strambi; Federico Coccolini; Alessio Mazzoni; Mario Miccoli; Camilla Cremonini; Enrico Cicuttin; Massimo Chiarugi
errShare
errSave
An Online Fairness-Aware Task Planning Approach for Spatial Crowdsourcing
err2024-01-01
err6
PREAI
errZhang, Jiale; Jiang, Tianxiang; Gao, Xiaofeng; Chen, Guihai
errShare
errSave
Purification of Hepatocytes and Sinusoidal Endothelial Cells from Mouse Liver Perfusion
err2018-02-12
err0
errOAAI
errFatima Cabral; Colton M. Miller; Katrina M. Kudrna; Blake E. Hass; Jocelyn G. Daubendiek; Brianna M. Kellar; Edward N. Harris
errShare
errSave
errShare
errSave
Fair Task Allocation in Crowdsourced Delivery
err2021-07-01
err34
errOAAI
errBasik, Fuat; Gedik, Bugra; Ferhatosmanoglu, Hakan; Wu, Kun-Lung
errShare
errSave
researcher View more