arrow
返回

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 *
徐明亮 封面图
徐明亮 (Mingliang Xu) *
DOI:10.1109/TMC.2023.3310591delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Task analysis
Mobile computing
Shared transport
Roads
Optimization
Schedules
Real-time systems
Crowdsourced mobility services
fairness
game theory
reinforcement learning
task assignment

期刊

IEEE Transactions on Mobile Computing 封面图
IEEE Transactions on Mobile Computing
IF:
9.2
论文数:
5.9K
被引数:
1.8W

机构

Z
Zhengzhou University
学者数:
6.8W
论文数: 4.4W
被引数: 8.5W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
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
err分享
err收藏
err分享
err收藏
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
err分享
err收藏
An Online Fairness-Aware Task Planning Approach for Spatial Crowdsourcing
err2024-01-01
err6
PREAI
errZhang, Jiale; Jiang, Tianxiang; Gao, Xiaofeng; Chen, Guihai
err分享
err收藏
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
err分享
err收藏
Fair Task Allocation in Crowdsourced Delivery
err2021-07-01
err34
errOAAI
errBasik, Fuat; Gedik, Bugra; Ferhatosmanoglu, Hakan; Wu, Kun-Lung
err分享
err收藏
学者 查看更多内容