EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing

Yan Zhao, Kai Zheng, Ziwei Wang, Liwei Deng, Bin Yang, Torben Bach Pedersen, Christian S. Jensen, Xiaofang Zhou

The VLDB Journal · 2024-01 · 33 (1) · 163-184

DOI: 10.1007/s00778-023-00802-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The VLDB Journal, online erschienen am 07.07.2023. Verfasst von Yan Zhao und 7 weiteren Autor:innen. Die Arbeit wurde bisher 31-mal zitiert (Crossref) und nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Aalborg University Library.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

With the widespread use of networked and geo-positioned mobile devices, e.g., smartphones, Spatial Crowdsourcing (SC), which refers to the assignment of location-based tasks to moving workers, is drawing increasing attention. One of the critical issues in SC is task assignment that allocates tasks to appropriate workers. We propose and study a novel SC problem, namely Coalition-based Task Assignment (CTA), where the spatial tasks (e.g., home improvement and furniture installation) may require more than one worker (forming a coalition) to cooperate to maximize the overall rewards of workers. We design a greedy and an equilibrium-based CTA approach. The greedy approach forms a set of worker coalitions greedily for performing tasks and uses an acceptance probability to identify high-value task assignments. In the equilibrium-based approach, workers form coalitions in sequence and update their strategies (i.e., selecting a best-response task), to maximize their own utility (i.e., the reward of the coalition they belong to) until a Nash equilibrium is reached. Since the equilibrium obtained is not unique and optimal in terms of total rewards, we further propose a simulated annealing scheme to find a better Nash equilibrium. To achieve fair task assignments, we optimize the framework to distribute rewards fairly among workers in a coalition based on their marginal contributions and give workers who arrive first at the SC platform highest priority. Extensive experiments demonstrate the efficiency and effectiveness of the proposed methods on real and synthetic data.

Förderung

  • Aalborg University Library

Zitieren

APA

Zhao, Y., Zheng, K., Wang, Z., Deng, L., Yang, B., Pedersen, T. B., Jensen, C. S., & Zhou, X. (2024). Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing. The VLDB Journal, 33(1), 163-184. https://doi.org/10.1007/s00778-023-00802-3

Vancouver

Zhao Y, Zheng K, Wang Z, Deng L, Yang B, Pedersen TB, et al. Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing. The VLDB Journal. 2024;33(1):163-184. doi:10.1007/s00778-023-00802-3

BibTeX
@article{Zhao2024,
  author = {Zhao, Yan and Zheng, Kai and Wang, Ziwei and Deng, Liwei and Yang, Bin and Pedersen, Torben Bach and Jensen, Christian S. and Zhou, Xiaofang},
  title = {Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing},
  journal = {The VLDB Journal},
  year = {2024},
  volume = {33},
  number = {1},
  pages = {163--184},
  doi = {10.1007/s00778-023-00802-3}
}
Kostenlos starten →