{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T15:04:42Z","timestamp":1779980682518,"version":"3.53.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Network and Computer Applications"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jnca.2026.104491","type":"journal-article","created":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T14:53:47Z","timestamp":1776610427000},"page":"104491","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["STA-MS: A many-to-many stable task allocation based on multi-round selection in mobile crowdsensing"],"prefix":"10.1016","volume":"251","author":[{"given":"Shiting","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8925-6453","authenticated-orcid":false,"given":"Kaimin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4157-5110","authenticated-orcid":false,"given":"Jinpeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jnca.2026.104491_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102968","article-title":"SDRS: A stable data-based recruitment system in IoT crowdsensing for localization tasks","volume":"177","author":"Alagha","year":"2021","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.jnca.2026.104491_b2","doi-asserted-by":"crossref","unstructured":"Chen, Xiao, 2019. A stable task assignment scheme in crowdsourcing. In: Proceedings of 2019 IEEE International Conference on Computational Science and Engineering. pp. 489\u2013494.","DOI":"10.1109\/CSE\/EUC.2019.00096"},{"key":"10.1016\/j.jnca.2026.104491_b3","doi-asserted-by":"crossref","first-page":"3439","DOI":"10.1109\/TMC.2020.3000234","article-title":"Stable task assignment for mobile crowdsensing with budget constraint","volume":"20","author":"Dai","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"3","key":"10.1016\/j.jnca.2026.104491_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3456756","article-title":"Allocation problems in ride-sharing platforms: Online matching with offline reusable resources","volume":"9","author":"Dickerson","year":"2021","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"Part","key":"10.1016\/j.jnca.2026.104491_b5","article-title":"Incentivizing fairness-aware task allocation in mobile crowdsensing with sweep coverage and stability control","volume":"97","author":"Duan","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"10.1016\/j.jnca.2026.104491_b6","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/MCOM.2015.7180523","article-title":"Crowdsending based public transport information service in smart cities","volume":"53","author":"Farkas","year":"2015","journal-title":"IEEE Commun. Mag."},{"issue":"7","key":"10.1016\/j.jnca.2026.104491_b7","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.3390\/s22072751","article-title":"A personalized task allocation strategy in mobile crowdsensing for minimizing total cost","volume":"22","author":"Gao","year":"2022","journal-title":"Sensors"},{"key":"10.1016\/j.jnca.2026.104491_b8","unstructured":"Ghodsi, Ali, Zaharia, Matei, Hindman, Benjamin, Konwinski, Andy, Shenker, Scott, Stoica, Ion, 2011. Dominant resource fairness: Fair allocation of multiple resource types. In: 8th USENIX Symposium on Networked Systems Design and Implementation. NSDI 11, Vol. 11, pp. 24\u201324."},{"key":"10.1016\/j.jnca.2026.104491_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100872","article-title":"Evolutionary multi-task allocation for mobile crowdsensing with limited resource","volume":"63","author":"Ji","year":"2021","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"10.1016\/j.jnca.2026.104491_b10","doi-asserted-by":"crossref","first-page":"761","DOI":"10.3982\/TE2717","article-title":"Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition","volume":"13","author":"Kamada","year":"2018","journal-title":"Theor. Econ."},{"key":"10.1016\/j.jnca.2026.104491_b11","first-page":"1","article-title":"Can we enhance the quality of mobile crowdsensing data without ground truth?","volume":"Preprints","author":"Li","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"5","key":"10.1016\/j.jnca.2026.104491_b12","doi-asserted-by":"crossref","first-page":"5385","DOI":"10.1109\/TMC.2023.3310591","article-title":"Fairness-guaranteed task assignment for crowdsourced mobility services","volume":"23","author":"Li","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.jnca.2026.104491_b13","article-title":"A hyper-heuristic optimization multi-task allocation in mobile crowdsensing based on inherent attributes","volume":"168","author":"Li","year":"2025","journal-title":"Ad Hoc Networks"},{"issue":"6","key":"10.1016\/j.jnca.2026.104491_b14","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-023-3133-6","article-title":"Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing","volume":"18","author":"Lin","year":"2024","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.jnca.2026.104491_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2025.104113","article-title":"Quality-aware multi-task allocation based on location importance in mobile crowdsensing","volume":"236","author":"Liu","year":"2025","journal-title":"J. Netw. Comput. Appl."},{"issue":"3","key":"10.1016\/j.jnca.2026.104491_b16","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1109\/TSC.2023.3325636","article-title":"Incentivizing proportional fairness for multi-task allocation in crowdsensing","volume":"17","author":"Lu","year":"2024","journal-title":"IEEE Trans. Serv. Comput."},{"key":"10.1016\/j.jnca.2026.104491_b17","doi-asserted-by":"crossref","unstructured":"Ludwig, Thomas, Reuter, Christian, Siebigteroth, Tim, Pipek, Volkmar, 2015. CrowdMonitor: Mobile crowd sensing for assessing physical and digital activities of citizens during emergencies. In: Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems. pp. 4083\u20134092.","DOI":"10.1145\/2702123.2702265"},{"key":"10.1016\/j.jnca.2026.104491_b18","series-title":"Series on Theoretical Computer Science","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1142\/8591","article-title":"Algorithmics of Matching Under Preferences","author":"Manlove","year":"2013","ISBN":"https:\/\/id.crossref.org\/isbn\/9789814425247"},{"key":"10.1016\/j.jnca.2026.104491_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2024.103836","article-title":"Privacy-preserving multiobjective task assignment scheme with differential obfuscation in mobile crowdsensing","volume":"224","author":"Peng","year":"2024","journal-title":"J. Netw. Comput. Appl."},{"issue":"5","key":"10.1016\/j.jnca.2026.104491_b20","doi-asserted-by":"crossref","first-page":"2597","DOI":"10.1109\/TSC.2023.3333832","article-title":"Matching-based hybrid service trading for task assignment over dynamic mobile crowdsensing networks","volume":"17","author":"Qi","year":"2024","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"4","key":"10.1016\/j.jnca.2026.104491_b21","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/moor.7.4.617","article-title":"The economics of matching: Stability and incentives","volume":"7","author":"Roth","year":"1982","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.jnca.2026.104491_b22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01210572","article-title":"Incentives in two-sided matching with random stable mechanisms","volume":"1","author":"Roth","year":"1991","journal-title":"Econom. Theory"},{"key":"10.1016\/j.jnca.2026.104491_b23","doi-asserted-by":"crossref","unstructured":"Simon, Bernd, Dongare, Sumedh, Mahn, Tobias, Ortiz, Andrea, Klein, Anja, 2022. Delay-and incentive-aware crowdsensing: A stable matching approach for coverage maximization. In: Proceedings of ICC 2022-IEEE International Conference on Communications. pp. 2984\u20132989.","DOI":"10.1109\/ICC45855.2022.9838603"},{"issue":"4","key":"10.1016\/j.jnca.2026.104491_b24","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1093\/oxrep\/grx048","article-title":"Market design for living-donor organ exchanges: An economic policy perspective","volume":"33","author":"S\u00f6nmez","year":"2017","journal-title":"Oxf. Rev. Econ. Policy"},{"issue":"12","key":"10.1016\/j.jnca.2026.104491_b25","doi-asserted-by":"crossref","first-page":"11971","DOI":"10.1109\/TMC.2024.3408751","article-title":"Fairness-aware two-stage hybrid sensing method in vehicular crowdsensing","volume":"23","author":"Wang","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"19","key":"10.1016\/j.jnca.2026.104491_b26","doi-asserted-by":"crossref","first-page":"18487","DOI":"10.1109\/JIOT.2022.3160887","article-title":"High-performance UAV crowdsensing: A deep reinforcement learning approach","volume":"9","author":"Wei","year":"2022","journal-title":"IEEE Internet Things J."},{"issue":"6","key":"10.1016\/j.jnca.2026.104491_b27","doi-asserted-by":"crossref","first-page":"6190","DOI":"10.1109\/TNSM.2025.3598025","article-title":"Stable task allocation in mobile crowdsensing: An interruption-driven approach","volume":"22","author":"Wei","year":"2025","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"8","key":"10.1016\/j.jnca.2026.104491_b28","doi-asserted-by":"crossref","first-page":"8066","DOI":"10.1109\/TMC.2023.3345865","article-title":"Group task recommendation in mobile crowdsensing: An attention-based neural collaborative approach","volume":"23","author":"Wei","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.jnca.2026.104491_b29","doi-asserted-by":"crossref","first-page":"3719","DOI":"10.1109\/TNSM.2021.3072638","article-title":"Competition-congestion-aware stable worker-task matching in mobile crowd sensing","volume":"18","author":"Yang","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"11","key":"10.1016\/j.jnca.2026.104491_b30","doi-asserted-by":"crossref","first-page":"9086","DOI":"10.1109\/JIOT.2021.3118134","article-title":"Online stable task assignment in opportunistic mobile crowdsensing with uncertain trajectories","volume":"9","author":"Yucel","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.jnca.2026.104491_b31","doi-asserted-by":"crossref","unstructured":"Yucel, Fatih, Bulut, Eyuphan, 2022b. Three-dimensional Stable Task Assignment in Semi-opportunistic Mobile Crowdsensing. In: 23rd IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2022. pp. 386\u2013395.","DOI":"10.1109\/WoWMoM54355.2022.00058"},{"key":"10.1016\/j.jnca.2026.104491_b32","doi-asserted-by":"crossref","first-page":"3194","DOI":"10.1109\/TMC.2020.2997280","article-title":"QoS-based budget constrained stable task assignment in mobile crowdsensing","volume":"20","author":"Yucel","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.jnca.2026.104491_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2023.103734","article-title":"An evolutionary multi-task assignment method adapting to travel convenience in mobile crowdsensing","volume":"220","author":"Zeng","year":"2023","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"10.1016\/j.jnca.2026.104491_b34","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/TMC.2022.3229112","article-title":"An online fairness-aware task planning approach for spatial crowdsourcing","volume":"23","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.jnca.2026.104491_b35","doi-asserted-by":"crossref","unstructured":"Zhang, Daqing, Xiong, Haoyi, Wang, Leye, Chen, Guanling, 2014. CrowdRecruiter: Selecting participants for piggyback crowdsensing under probabilistic coverage constraint. In: Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing. pp. 703\u2013714.","DOI":"10.1145\/2632048.2632059"},{"issue":"2","key":"10.1016\/j.jnca.2026.104491_b36","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1109\/TMC.2021.3088291","article-title":"Multi-task allocation in mobile crowd sensing with mobility prediction","volume":"22","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Mob. Comput."}],"container-title":["Journal of Network and Computer Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804526000664?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804526000664?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T14:25:46Z","timestamp":1779978346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1084804526000664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":36,"alternative-id":["S1084804526000664"],"URL":"https:\/\/doi.org\/10.1016\/j.jnca.2026.104491","relation":{},"ISSN":["1084-8045"],"issn-type":[{"value":"1084-8045","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"STA-MS: A many-to-many stable task allocation based on multi-round selection in mobile crowdsensing","name":"articletitle","label":"Article Title"},{"value":"Journal of Network and Computer Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jnca.2026.104491","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104491"}}