Cost Minimization and Social Fairness for Spatial Crowdsourcing Tasks - IMT - Institut Mines-Télécom Access content directly
Conference Papers Year : 2016

Cost Minimization and Social Fairness for Spatial Crowdsourcing Tasks

Abstract

Spatial crowdsourcing is an activity consisting in outsourcing spatial tasks to a community of online, yet on-ground and mobile, workers. A spatial task is characterized by the requirement that workers must move from their current location to a specified location to accomplish the task. We study the assignment of spatial tasks to workers. A sequence of sets of spatial tasks is assigned to workers as they arrive. We want to minimize the cost incurred by the movement of the workers to perform the tasks. In the meanwhile, we are seeking solutions that are socially fair. We discuss the competitiveness in terms of competitive ratio and social fairness of the Work Function Algorithm, the Greedy Algorithm, and the Randomized versions of the Greedy Algorithm to solve this problem. These online algorithms are memory-less and are either inefficient or unfair. In this paper, we devise two Distribution Aware Algorithms that utilize the distribution information of the tasks and that assign tasks to workers on the basis of the learned distribution. With realistic and synthetic datasets, we empirically and comparatively evaluate the performance of the three baseline and two Distribution Aware Algorithms.

Fichier principal
Vignette du fichier
inproceedings-2016-16048-5.pdf (3.53 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01700150 , version 1 (03-02-2018)

Identifiers

  • HAL Id : hal-01700150 , version 1

Cite

Qing Liu, Talel Abdessalem, Huayu Wu, Zihong Yuan, Stéphane Bressan. Cost Minimization and Social Fairness for Spatial Crowdsourcing Tasks. The 21st International Conference on Database Systems for Advanced Applications , Apr 2016, Dallas, United States. ⟨hal-01700150⟩
340 View
348 Download

Share

Gmail Facebook X LinkedIn More