Abstract
With the development of sharing economy, multi-platform cooperative matching (MPCM) is becoming popular as it provides an effective way to cope with the supply-demand imbalance in spatial crowdsourcing (SC). While cooperation between two SC platforms in MPCM has been intensively studied, competition among multiple SC platforms is largely overlooked by existing work. In particular, an idle worker may be requested by multiple platforms simultaneously, but he/she can only accept some of them due to capacity constraints. This partial acceptance will decrease the revenue of some platforms and thus should be addressed properly. Towards this goal, we investigate in this paper the problem of acceptance-aware multi-platform cooperative matching. We first design an algorithm called BaseMPCM to predict the acceptance rate of workers and calculate the utility scores of task-and-worker pairs. Considering that in BaseMPCM, the platforms make the decision from their own benefits, and this may lead to a sub-optimal total revenue, we further design an algorithm called DeepMPCM to predict the action of other platforms and calculate the utility scores globally. Extensive experiments on real and synthetic datasets demonstrate the effectiveness of our algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gaia of didi. https://outreach.didichuxing.com/research/opendata/en/
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)
Cheng, P., Lian, X., Chen, L., Han, J., Zhao, J.: Task assignment on multi-skill oriented spatial crowdsourcing. TKDE 28(8), 2201–2215 (2016)
Cheng, P., et al.: Reliable diversity-based spatial crowdsourcing by moving workers. PVLDB 8(10), 1022–1033 (2015)
Cheng, Y., Li, B., Zhou, X., Yuan, Y., Wang, G., Chen, L.: Real-time cross online matching in spatial crowdsourcing. In: ICDE, pp. 1–12 (2020)
Ding, P., Liu, G., Wang, Y., Zheng, K., Zhou, X.: A-MCTS: adaptive monte carlo tree search for temporal path discovery. In: TKDE, pp. 1–1 (2021)
Fan, J., Zhou, X., Gao, X., Chen, G.: Crowdsourcing task scheduling in mobile social networks. In: ICSOC, pp. 317–331 (2018)
Jiang, Y., He, W., Cui, L., Yang, Q.: User location prediction in mobile crowdsourcing services. In: ICSOC, pp. 515–523 (2018)
Li, B., Cheng, Y., Yuan, Y., Wang, G., Chen, L.: Simultaneous arrival matching for new spatial crowdsourcing platforms. In: IJCAI, pp. 1279–1287 (2020)
Liu, C., Gao, X., Wu, F., Chen, G.: QITA: quality inference based task assignment in mobile crowdsensing. In: ICSOC, pp. 363–370 (2018)
Liu, G., et al.: MCS-GPM: multi-constrained simulation based graph pattern matching in contextual social graphs. TKDE 30(6), 1050–1064 (2018)
Liu, G., Wang, Y., Orgun, M.A.: Finding k optimal social trust paths for the selection of trustworthy service providers in complex social networks. TSC 6(2), 152–167 (2013)
Liu, G., Wang, Y., Zheng, B., Li, Z., Zheng, K.: Strong social graph based trust-oriented graph pattern matching with multiple constraints. TETCI 4(5), 675–685 (2020)
To, H., Shahabi, C., Kazemi, L.: A server-assigned spatial crowdsourcing framework. ACM Trans. Spat. Algorithms Syst. 1(1), 2:1–2:28 (2015)
Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: Experiments and analysis. PVLDB 9(12), 1053–1064 (2016)
Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowdsourcing. In: ICDE, pp. 49–60 (2016)
Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: SIGMOD, pp. 773–788 (2018)
Zhang, Z., Liu, A., Liu, S., Li, Z., Zhao, L.: Privacy-preserving worker recruitment under variety requirement in spatial crowdsourcing. In: ICSOC, pp. 302–316 (2021)
Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: An online stable matching approach. In: AAAI, pp. 2245–2252 (2019)
Zhao, Y., Guo, J., Chen, X., Hao, J., Zhou, X., Zheng, K.: Coalition-based task assignment in spatial crowdsourcing. In: ICDE, pp. 241–252 (2021)
Zhao, Y., Zheng, K., Guo, J., Yang, B., Pedersen, T.B., Jensen, C.S.: Fairness-aware task assignment in spatial crowdsourcing: game-theoretic approaches. In: ICDE, pp. 265–276 (2021)
Zheng, L., Chen, L.: Maximizing acceptance in rejection-aware spatial crowdsourcing. TKDE 29(9), 1943–1956 (2017)
Acknowledgements
This work is supported by Natural Science Foundation of Jiangsu Province (Grant Nos. BK20211307), by project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions, and by NH33714722 Youth Team on Interdisciplinary Research Soochoow University - Research on Subjectivity and Reasoning Theory in Artificial Intelligence.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, X., Liu, A., Liu, G., Xu, J., Zhao, L. (2022). Acceptance-Aware Multi-platform Cooperative Matching in Spatial Crowdsourcing. In: Troya, J., Medjahed, B., Piattini, M., Yao, L., Fernández, P., Ruiz-Cortés, A. (eds) Service-Oriented Computing. ICSOC 2022. Lecture Notes in Computer Science, vol 13740. Springer, Cham. https://doi.org/10.1007/978-3-031-20984-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-031-20984-0_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20983-3
Online ISBN: 978-3-031-20984-0
eBook Packages: Computer ScienceComputer Science (R0)