{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:20:40Z","timestamp":1757618440086,"version":"3.44.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62462056"],"award-info":[{"award-number":["62462056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yunnan Fundamental Research Projects","award":["202501AT070393"],"award-info":[{"award-number":["202501AT070393"]}]},{"name":"Special Basic Cooperative Research Programs of Yunnan Provincial Undergraduate Universities\u2019 Association","award":["202401BA070001-135"],"award-info":[{"award-number":["202401BA070001-135"]}]},{"name":"Special Basic Cooperative Research Innovation Programs of Qujing Science and Technology Bureau & Qujing Normal University","award":["KJLH2023YB12"],"award-info":[{"award-number":["KJLH2023YB12"]}]},{"name":"Applied Research Project of Education Department of Yunnan Province","award":["2025J0897"],"award-info":[{"award-number":["2025J0897"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The development of network equipment and sensing technology has led to the increasing popularity of spatial crowdsourcing (SC). This paper addresses the spatial task allocation problem in the SC system, where workers perform spatial tasks allocated to them at the designated location. Existing studies typically focus on one worker who can only perform one task type at a time. Unfortunately, this approach significantly reduces the efficiency of workers\u2019 output in practical applications. Hence, we propose a multi-type adaptability service model wherein a worker can simultaneously perform multiple types of tasks. Considering mutually exclusive task types, we propose a compatible allocation of task types. Furthermore, we propose a work capacity that enables a worker to perform multiple tasks simultaneously within the work capacity limits. An auction-based pricing model is proposed to provide scalable services and maximize the value of spatial tasks. We propose an efficient allocation mechanism and show that it achieves strategy-proof and group strategy-proof. In addition, the proposed mechanism achieves voluntary participation, individual rationality, consumer sovereignty, and budget balance. Moreover, the approximation of the proposed mechanism is analyzed. Finally, we use comprehensive simulations to verify the performance of the proposed mechanism.<\/jats:p>","DOI":"10.1007\/s44443-025-00098-z","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T04:07:21Z","timestamp":1750651641000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Group strategy-proof mechanism for compatible multi-type adaptability service in spatial crowdsourcing"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8011-5419","authenticated-orcid":false,"given":"Xi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,23]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"Abdeddine A, Iraqi Y, Mekouar L (2025) Mobile crowdsensing model: a survey. J Syst Archit 162","DOI":"10.1016\/j.sysarc.2025.103384"},{"key":"98_CR2","doi-asserted-by":"crossref","unstructured":"Abla P, Fang W, Li T, Deng Z, Xie A (2025) An efficient and privacy-preserving spatial crowdsourcing protocol from hash functions for iot. IEEE Internet things J","DOI":"10.1109\/JIOT.2025.3535534"},{"key":"98_CR3","doi-asserted-by":"crossref","unstructured":"Akram J, Anaissi A, Akram A, Rathore R S, Jhaveri R H (2024) Adversarial label-flipping attack and defense for anomaly detection in spatial crowdsourcing uav services. IEEE Trans Consum Electron","DOI":"10.1109\/TCE.2024.3448541"},{"key":"98_CR4","doi-asserted-by":"crossref","unstructured":"Akram J, Anaissi A, Rathore R S, Jhaveri R H, Akram A (2024) GALTrust: generative adverserial learning-based framework for trust management in spatial crowdsourcing drone services 70(3):6196-6207","DOI":"10.1109\/TCE.2024.3384978"},{"issue":"1","key":"98_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TBDATA.2024.3403374","volume":"11","author":"H Bao","year":"2025","unstructured":"Bao H, Wang Z, Lu R, Huang C, Li B (2025) TAMT: Privacy-preserving task assignment with multi-threshold range search for spatial crowdsourcing applications. IEEE Trans Big Data 11(1):208\u2013220","journal-title":"IEEE Trans Big Data"},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"Cheng Y, Li B, Zhou X, Yuan Y, Wang G, Chen L (2020) Real-time cross online matching in spatial crowdsourcing. In: Proceeding IEEE 36th international conference on data engineering","DOI":"10.1109\/ICDE48307.2020.00008"},{"key":"98_CR7","doi-asserted-by":"crossref","unstructured":"Chen X, Wang K (2025) GNSS spoofing detection by crowdsourcing double differential pseudorange spatial distribution. IEEE Trans Instrum Meas 74","DOI":"10.1109\/TIM.2025.3533637"},{"issue":"1","key":"98_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke EH (1971) Multipart pricing of public goods. Public Choice 11(1):17\u201333","journal-title":"Public Choice"},{"key":"98_CR9","doi-asserted-by":"crossref","unstructured":"Feldman M, Gkatzelis V, Gravin N, Schoepflin D (2022) Bayesian and randomized clock auctions. Proceedings of the 23rd ACM conference on economics and computation 820-2845","DOI":"10.1145\/3490486.3538247"},{"key":"98_CR10","doi-asserted-by":"crossref","unstructured":"Groves T (1973) Incentives in teams. Econometrica: J Econ Soc 41(4):617-631","DOI":"10.2307\/1914085"},{"issue":"24","key":"98_CR11","doi-asserted-by":"publisher","first-page":"40100","DOI":"10.1109\/JIOT.2024.3450710","volume":"11","author":"Y Han","year":"2024","unstructured":"Han Y, Li Z, Zhao Z, Braum T (2024) CrowdBERT: crowdsourcing indoor positioning via semi-supervised bert with masking. IEEE Internet Things J 11(24):40100\u201340112","journal-title":"IEEE Internet Things J"},{"key":"98_CR12","doi-asserted-by":"crossref","unstructured":"Han X, Lin B, Na Z, Li B, Zhang C, Zhang R (2025) Spatial crowdsourcing-based task allocation for uav-assisted maritime data collection. IEEE Trans Veh Technol 74(2):3375\u20133388","DOI":"10.1109\/TVT.2024.3483890"},{"key":"98_CR13","unstructured":"IBM ILOG CPLEX Optimizer. (2022) [Online]. Available: https:\/\/www.ibm.com\/analytics\/cplex-optimizer"},{"key":"98_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"HH Kellerer","year":"2004","unstructured":"Kellerer HH, Pferschy U, Pisinger D (2004) Knapsack Problems. Springer"},{"issue":"5","key":"98_CR15","doi-asserted-by":"publisher","first-page":"5677","DOI":"10.1109\/TNSM.2024.3426076","volume":"21","author":"X Liu","year":"2024","unstructured":"Liu X, Li W (2024) A truthful randomized mechanism for heterogeneous resource allocation with multi-minded in mobile edge computing. IEEE Trans Netw Serv Manage 21(5):5677\u20135690","journal-title":"IEEE Trans Netw Serv Manage"},{"key":"98_CR16","doi-asserted-by":"publisher","first-page":"17594","DOI":"10.1007\/s11227-022-04564-7","volume":"78","author":"X Liu","year":"2022","unstructured":"Liu X, Liu J (2022) An online mechanism for task allocation and pricing in crowd sensing systems. J Supercomput 78:17594\u201317618","journal-title":"J Supercomput"},{"issue":"5","key":"98_CR17","doi-asserted-by":"publisher","first-page":"2579","DOI":"10.1109\/TSC.2021.3075541","volume":"15","author":"X Liu","year":"2022","unstructured":"Liu X, Liu J (2022) A truthful double auction mechanism for multi-resource allocation in crowd sensing systems. IEEE Trans Serv Comput 15(5):2579\u20132590","journal-title":"IEEE Trans Serv Comput"},{"issue":"6","key":"98_CR18","doi-asserted-by":"publisher","first-page":"7967","DOI":"10.1109\/TCSS.2024.3410273","volume":"11","author":"D Liu","year":"2024","unstructured":"Liu D, Shang L, Dai X, Zhang Z (2024) Modeling and solving the allocation problem of spatiotemporal crowdsourced logistics tasks in social manufacturing. IEEE Trans Comput Soc Syst 11(6):7967\u20137975","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"98_CR19","doi-asserted-by":"crossref","unstructured":"Liu X, Liu J (2024) A truthful randomized mechanism for task allocation with multi-attributes in mobile edge computing. J King Saud University - Comput Inform Sci 36(9)","DOI":"10.1016\/j.jksuci.2024.102196"},{"key":"98_CR20","doi-asserted-by":"crossref","unstructured":"Liu X, Liu J, Li W (2024) Truthful mechanism for joint resource allocation and task offloading in mobile edge computing. Comput Netw 254","DOI":"10.1016\/j.comnet.2024.110796"},{"key":"98_CR21","doi-asserted-by":"crossref","unstructured":"Liu X, Liu J, Li W (2025) Truthful mechanism for resource allocation and pricing in vehicle-assisted mobile edge computing. IEEE Trans Veh Technol","DOI":"10.1109\/TVT.2025.3526935"},{"key":"98_CR22","doi-asserted-by":"crossref","unstructured":"Liu X, Liu J, Wu H, Dong aJ (2025) An online mechanism for resource provisioning and allocation in vehicle computing. Computing 107","DOI":"10.1007\/s00607-025-01428-9"},{"issue":"2","key":"98_CR23","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TSC.2024.3353293","volume":"17","author":"Y Ma","year":"2024","unstructured":"Ma Y, Gao X, Bhatti SS, Chen G (2024) Clustering based priority queue algorithm for spatial task assignment in crowdsourcing. IEEE Trans Serv Comput 17(2):452\u2013465","journal-title":"IEEE Trans Serv Comput"},{"issue":"4","key":"98_CR24","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1109\/TKDE.2023.3311816","volume":"3","author":"H Miao","year":"2024","unstructured":"Miao H, Zhong X, Liu J, Zhao Y, Zhao X, Qian W (2024) Task assignment with efficient federated preference learning in spatial crowdsourcing. IEEE Trans Knowl Data Eng 3(4):1800\u20131814","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"98_CR25","first-page":"511","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin H, Shenker S (2001) Strategyproof sharing of submodular costs:budget balance versus efficiency 18:511\u2013533","journal-title":"Strategyproof sharing of submodular costs:budget balance versus efficiency"},{"key":"98_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge University Press"},{"issue":"4","key":"98_CR27","doi-asserted-by":"publisher","first-page":"4006","DOI":"10.1109\/TDSC.2023.3342239","volume":"21","author":"F Song","year":"2024","unstructured":"Song F, Liang J, Zhang C, Fu Z, Qin Z, Guo S (2024) Achieving efficient and privacy-preserving location-based task recommendation in spatial crowdsourcing. IEEE Trans Dependable Secure Comput 21(4):4006\u20134023","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"1","key":"98_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(1):8\u201337","journal-title":"J Financ"},{"key":"98_CR29","doi-asserted-by":"crossref","unstructured":"Wang H, Mai J, Zhang L, Shen L, Cui L, Liu J (2024) Towards privacy-preserving spatial crowdsourcing: from offline to online. IEEE Network","DOI":"10.1109\/MNET.2024.3440018"},{"issue":"12","key":"98_CR30","doi-asserted-by":"publisher","first-page":"13048","DOI":"10.1109\/TMC.2024.3423396","volume":"23","author":"Q Wu","year":"2024","unstructured":"Wu Q, Li Y, Zhu G, Mei B, Xu J (2024) Prediction-aware adaptive task assignment for spatial crowdsourcing. IEEE Trans Mob Comput 23(12):13048\u201313061","journal-title":"IEEE Trans Mob Comput"},{"issue":"4","key":"98_CR31","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1109\/TMC.2024.3501734","volume":"24","author":"Q Wu","year":"2025","unstructured":"Wu Q, Li Y, Yan J, Zhang M, Xu J, Xu M (2025) Adaptive task assignment in spatial crowdsourcing: a human-in-the-loop approach. IEEE Trans Mob Comput 24(4):2726\u20132739","journal-title":"IEEE Trans Mob Comput"},{"issue":"4","key":"98_CR32","doi-asserted-by":"publisher","first-page":"4536","DOI":"10.1109\/JIOT.2024.3485650","volume":"12","author":"Y Xia","year":"2025","unstructured":"Xia Y, Wang H, Cao T, Liu X, Liu Z (2025) Personalized privacy preserving for spatial crowdsourcing by reinforcement learning in VANETs. IEEE Internet Things J 12(4):4536\u20134547","journal-title":"IEEE Internet Things J"},{"issue":"11","key":"98_CR33","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TPDS.2024.3434978","volume":"35","author":"Y Xu","year":"2024","unstructured":"Xu Y, Xiao M, Wu J, Sun H (2024) Privacy preserving task push in spatial crowdsourcing with unknown popularity. IEEE Trans Parallel Distrib Syst 35(11):2039\u20132053","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"98_CR34","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TMC.2022.3229112","volume":"23","author":"J Zhang","year":"2024","unstructured":"Zhang J, Jiang T, Gao X, Chen G (2024) An online fairness-aware task planning approach for spatial crowdsourcing. IEEE Trans Mob Comput 23(1):150\u2013163","journal-title":"IEEE Trans Mob Comput"},{"issue":"9","key":"98_CR35","doi-asserted-by":"publisher","first-page":"4943","DOI":"10.1109\/TKDE.2024.3374086","volume":"36","author":"Y Zhao","year":"2024","unstructured":"Zhao Y, Chen X, Ye G, Guo F, Zheng K, Zhou X (2024) Task allocation in spatial crowdsourcing: an efficient geographic partition framework. IEEE Trans Knowl Data Eng 36(9):4943\u20134955","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"98_CR36","doi-asserted-by":"publisher","first-page":"3803","DOI":"10.1109\/TCSS.2023.3332564","volume":"11","author":"B Zhao","year":"2024","unstructured":"Zhao B, Dong H, Wang Y, Gao X, Pan T (2024) An enhanced task allocation algorithm for mobile crowdsourcing based on spatiotemporal attention network. IEEE Trans Comput Soc Syst 11(3):3803\u20133815","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"98_CR37","doi-asserted-by":"crossref","unstructured":"Zheng Y, Zhou M, Wang S, Hua Z, Jiang J, Gao Y (2024) Privacy-preserving competitive detour tasking in spatial crowdsourcing. IEEE Trans Serv Comput 18(1):385\u2013398","DOI":"10.1109\/TSC.2024.3511992"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00098-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T21:58:49Z","timestamp":1757195929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00098-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00098-z","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,6,23]]},"assertion":[{"value":"24 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"76"}}