4.7 Article

Competition and Cooperation: Global Task Assignment in Spatial Crowdsourcing

期刊

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2023.3251443

关键词

Auction; crowdsroucing; incentive mechanism; spatial databases; task assignment

向作者/读者索取更多资源

This paper investigates the global task assignment problem in online spatial crowdsourcing platforms. The authors propose an auction-based incentive mechanism and two assignment algorithms to improve the profit of the platforms through cooperation.
Online spatial crowdsourcing platforms provide popular O2O services in people's daily. Users submit real-time tasks through the Internet and require the platform to immediately assign workers to serve them. However, the imbalance distribution of tasks and workers leads to the rejection of some tasks, which reduces the profit of the platform. In this paper, we propose that similar platforms can form an alliance to make full use of the global service supply through cooperation. We name the problem as Global Task Assignment (GTA), in which platforms are allowed to hire idle workers from other platforms to improve the profit of all the platforms together. Different from relevant works, the decision-makers in GTA are platforms rather than individual workers, which can better assign workers in all platforms and improve the overall profit. We design an auction-based incentive mechanism (AIM), to motivate platforms to rent idle workers to other platforms so that increase their own profit. Based on the mechanism, we propose a greedy-based assignment algorithm (BaseGTA), in which platforms greedily maximizes their current profit. We further propose a prediction-based assignment algorithm (ImpGTA), in which platforms make decisions based on the spatial-temporal distribution in the future time. Experimental results show that platforms using our algorithms can achieve higher profit than the existing studies.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据