{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:19:19Z","timestamp":1779358759290,"version":"3.51.4"},"reference-count":58,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of High Speed Networks"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>In a distributed system framework, spatial crowdsourcing (SC) is a highly important area of research where task allocation to task executors (TEs) is an important step. Tasks are requested by a task provider and are allocated by an SC platform to TEs. However, TEs may submit the allocated task as late as possible, known as procrastination. Plenty of research works are available on task allocation in SC, whereas few research works are found that address procrastination. In a bipartite graph setting, a procrastination-aware scheduling is proposed. A recent work uses ChatGPT for procrastinating agents. Balanced distribution of tasks has not been addressed there. Recently, an algorithm was proposed that distributes tasks in a balanced manner in different slots to mitigate procrastination in SC. Here, we propose a quality-aware task allocation mechanism in an SC environment that combines a data science approach with a reinforcement learning-based approach. Once TEs are allocated tasks, we have proposed an AI-enabled (learning-the-variance) algorithm to distribute the tasks into slots with a more balanced distribution than any of the existing algorithms to mitigate procrastination. Our procrastination prevention mechanism outperforms existing methods, which is shown by extensive simulations. Analytically, it is shown that the proposed mechanism maintains a balanced distribution.<\/jats:p>","DOI":"10.1177\/09266801251388373","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T17:35:06Z","timestamp":1762191306000},"page":"292-319","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Spatial crowdsourcing: An AI-based quality-aware task allocation and procrastination prevention mechanism"],"prefix":"10.1177","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9407-2931","authenticated-orcid":false,"given":"Naren","family":"Debnath","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, National Institute of Technology Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3030-705X","authenticated-orcid":false,"given":"Sajal","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, National Institute of Technology Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6569-5497","authenticated-orcid":false,"given":"Fatos","family":"Xhafa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"223","article-title":"A dynamic decision model of users\u2019 sustained participation in crowdsourcing innovation","volume":"9","author":"Qing-liang M","year":"2018","unstructured":"Qing-liang M, Xin-hui X. A dynamic decision model of users\u2019 sustained participation in crowdsourcing innovation. Int J Serv Oper Inform 2018; 9: 223\u2013241.","journal-title":"Int J Serv Oper Inform"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3291933"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7509386"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3209722"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/smartcities3020018"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.3390\/s17040668"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Djigal H Liu L Luo J et al. Buda: budget and deadline aware scheduling algorithm for task graphs in heterogeneous systems. In: 2022 IEEE\/ACM 30th international symposium on quality of service (IWQoS) online 10\u201312 June 2022 pp.1\u201310. IEEE Xplore Digital Library.","DOI":"10.1109\/IWQoS54832.2022.9812865"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2021.116536"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Ni W Cheng P Chen L et al. Task allocation in dependency-aware spatial crowdsourcing. In: 2020 IEEE 36th international conference on data engineering (ICDE) Dallas Texas 20\u201324 April 2020 pp.985\u2013996. New York USA: IEEE.","DOI":"10.1109\/ICDE48307.2020.00090"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00568-7"},{"key":"e_1_3_2_12_2","first-page":"1020","article-title":"A budget and deadline aware task assignment scheme for crowdsourcing environment","volume":"10","author":"Yadav A","year":"2021","unstructured":"Yadav A, Chandra J, Sairam AS. A budget and deadline aware task assignment scheme for crowdsourcing environment. IEEE Trans Emerg Top Comput, 2021; 10: 1020\u20131034.","journal-title":"IEEE Trans Emerg Top Comput,"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3069462"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Ye Y Liu CH Dai Z et al. Exploring both individuality and cooperation for air-ground spatial crowdsourcing by multi-agent deep reinforcement learning. In: 2023 IEEE 39th international conference on data engineering (ICDE) Anaheim United States 3\u20137 April 2023 pp.205\u2013217. New York USA: IEEE.","DOI":"10.1109\/ICDE55515.2023.00023"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3345416"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9071085"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Kleinberg J Oren S. Time-inconsistent planning: a computational problem in behavioral economics. In: Proceedings of the fifteenth ACM conference on economics and computation Palo Alto California 8\u201312 June 2014 pp.547\u2013564. New York USA: ACM\u00a0.","DOI":"10.1145\/2600057.2602890"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Kleinberg J Oren S Raghavan M. Planning with multiple biases. In: Proceedings of the 2017 ACM conference on economics and computation Massachusetts USA 26\u201330 June 2017 pp.567\u2013584. New York USA: ACM.","DOI":"10.1145\/3033274.3085156"},{"key":"e_1_3_2_19_2","unstructured":"Tang P Teng Y Wang Z et al. Computational issues in time-inconsistent planning. In: Thirty-first AAAI conference on artificial intelligence San Francisco California \u00a04\u20139 February 2017 pp.3665\u20133671. Palo Alto California: The Association for the Advancement of Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_20_2","unstructured":"Tim R. CS269I: Incentives in Computer Science. Lecture #19: Time-Inconsistent Planning. Stanford University https:\/\/timroughgarden.org\/f16\/l\/l19.pdf last accessed on December 5 2016."},{"key":"e_1_3_2_21_2","first-page":"1","article-title":"Procrastination and obedience","volume":"81","author":"Akerlof GA","year":"1991","unstructured":"Akerlof GA. Procrastination and obedience. Am Econ Rev 1991; 81: 1\u201319.","journal-title":"Am Econ Rev"},{"key":"e_1_3_2_22_2","volume-title":"Prospect theory: an analysis of decision under risk","author":"Kahneman D","year":"2013","unstructured":"Kahneman D, Tversky A. Prospect theory: an analysis of decision under risk. Singapore: World Scientific, 2013. chapter 6, pp.99\u2013127."},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Wang L Tong Y Hu C et al. Procrastination-aware scheduling: a bipartite graph perspective. In: 2019 IEEE 35th international conference on data engineering (ICDE) Macao China 8\u201311 April 2019 pp.1650\u20131653. New York USA: IEEE.","DOI":"10.1109\/ICDE.2019.00164"},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Arakawa R Yakura H Goto M. Catalyst: domain-extensible intervention for preventing task procrastination using large generative models. In: Proceedings of the 2023 CHI conference on human factors in computing systems Hamburg Germany 23\u201328 April 2023 pp.1\u201319. ACM New York USA.","DOI":"10.1145\/3544548.3581133"},{"key":"e_1_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Debnath N Mukhopadhyay S Xhafa F. An efficient algorithm to prevent procrastination in spatial crowdsourcing. In: Proceedings of conference on P2P parallel grid cloud and internet computing San Benedetto del Tronto Italy 13\u201315 November 2024 pp.142\u2013153. Switzerland: Springer Nature.","DOI":"10.1007\/978-3-031-76462-2_13"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_28_2","volume-title":"Reinforcement learning: an introduction","author":"Sutton RS","year":"1998","unstructured":"Sutton RS, Barto AG, et al. Reinforcement learning: an introduction. vol. 1. Cambridge, Massachusetts: MIT Press, 1998."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2021.3057376"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3423396"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3374086"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.3390\/a14030077"},{"key":"e_1_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Liang Z Tan W Liu J et al. Multi-skill collaboration-based task assignment in spatial crowdsourcing. In: International conference on computer application and information security (ICCAIS 2021) Biarritz France vol. 12260 1\u20133 November 2022 pp.42\u201348. Bellingham Washington USA: SPIE.","DOI":"10.1117\/12.2637391"},{"key":"e_1_3_2_34_2","unstructured":"Debnath N Mukhopadhyay S Xhafa F. Mitigating procrastination in crowdsourcing via efficient scheduling algorithm. arXiv preprint arXiv:2401.00681 2024."},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","unstructured":"Mukhopadhyay J Vikash K Mukhopadhyay S et al. A balanced dissemination of time constraint tasks in mobile crowdsourcing: A double auction perspective. In: Advances on P2P parallel grid cloud and internet computing: Proceedings of the 15th international conference on P2P parallel grid cloud and internet computing (3PGCIC-2020) 15 Yonago Tottori Japan 28\u201330 October 2021 pp.74\u201385. Berlin Germany: Springer.","DOI":"10.1007\/978-3-030-61105-7_8"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-023-09783-8"},{"key":"e_1_3_2_37_2","first-page":"201","article-title":"Dynamic cost-optimized resources management and task scheduling with deadline constraint for mobile crowd sensing environment","volume":"16","author":"Al-muqarm AMA","year":"2023","unstructured":"Al-muqarm AMA, Hussien NA. Dynamic cost-optimized resources management and task scheduling with deadline constraint for mobile crowd sensing environment. Int J Intell Eng Syst 2023; 16: 201\u2013219.","journal-title":"Int J Intell Eng Syst"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2024.102736"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2922604"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJSNET.2021.113628"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03433-3"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-04151-6"},{"key":"e_1_3_2_43_2","article-title":"Analysis of behavioral economics in crowdsensing: a loss aversion cooperation model","volume":"2018","author":"Li D","year":"2018","unstructured":"Li D, Qiu L, Liu J, et al. Analysis of behavioral economics in crowdsensing: a loss aversion cooperation model. Sci Program 2018; 2018: 4350183.","journal-title":"Sci Program"},{"key":"e_1_3_2_44_2","first-page":"9123","article-title":"Crowdsensing from the perspective of behavioral economics: an incentive mechanism based on mental accounting","volume":"6","author":"Li D","year":"2019","unstructured":"Li D, Wang S, Liu J, et\u00a0al. Crowdsensing from the perspective of behavioral economics: an incentive mechanism based on mental accounting. IEEE Int Things J 2019; 6: 9123\u20139139.","journal-title":"IEEE Int Things J"},{"key":"e_1_3_2_45_2","first-page":"44","article-title":"An incentive mechanism based on behavioural economics in location-based crowdsensing considering an uneven distribution of participants","volume":"21","author":"Liu J","year":"2020","unstructured":"Liu J, Yang Y, Li D et al. An incentive mechanism based on behavioural economics in location-based crowdsensing considering an uneven distribution of participants. IEEE Trans Mobile Comput 2020; 21: 44\u201362.","journal-title":"IEEE Trans Mobile Comput"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10030225"},{"key":"e_1_3_2_47_2","volume-title":"Reinforcement learning: an introduction","author":"Sutton RS","year":"2018","unstructured":"Sutton RS, Barto AG. Reinforcement learning: an introduction. Cambridge, MA: A Bradford Book, 2018."},{"key":"e_1_3_2_48_2","unstructured":"Roughgarden T. Cs261: a second course in algorithms lecture# 18: Five essential tools for the analysis of randomized algorithms 2016."},{"key":"e_1_3_2_49_2","volume-title":"Probability and computing: randomized algorithms and probabilistic analysis","author":"Upfal Eli MM","year":"2005","unstructured":"Upfal Eli MM. Probability and computing: randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press, 2005."},{"key":"e_1_3_2_50_2","volume-title":"Introduction to algorithms","author":"Cormen TH","year":"2010","unstructured":"Cormen TH, Leiserson CE, Rivest RL, et al. Introduction to algorithms. Cambridge, Massachusetts: PHI Learning (Originally MIT Press), 2010."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195290017"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2500121"},{"key":"e_1_3_2_53_2","unstructured":"Correa J Cristi A Epstein B et\u00a0al. Sample-driven optimal stopping: from the secretary problem to the iid prophet inequality. arXiv preprint arXiv:2011.06516 2020."},{"key":"e_1_3_2_54_2","doi-asserted-by":"crossref","unstructured":"Hajiaghayi MT Kleinberg R Parkes DC. Adaptive limited-supply online auctions. In: Proceedings of the 5th ACM conference on electronic commerce New York USA 17\u201320 May 2004 pp.71\u201380. New York USA: ACM.","DOI":"10.1145\/988772.988784"},{"key":"e_1_3_2_55_2","unstructured":"Kleinberg R. A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms Vancouver British Columbia Canada 23\u201325 January 2005 pp.630\u2013631. Philadelphia PA United States: SIAM."},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","unstructured":"Nuti P. The secretary problem with distributions. In: International conference on integer programming and combinatorial optimization Eindhoven The Netherlands 27\u201329 June 2022 pp.429\u2013439. Berlin Germany: Springer.","DOI":"10.1007\/978-3-031-06901-7_32"},{"key":"e_1_3_2_57_2","article-title":"Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm","volume":"23","author":"Constantino AA","year":"2017","unstructured":"Constantino AA, de Mendonca CF, de Araujo SA, et al. Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. J Univers Comput Sci 2017; 23: 479\u2013504.","journal-title":"J Univers Comput Sci"},{"key":"e_1_3_2_58_2","doi-asserted-by":"crossref","unstructured":"Feng W Tang J Liu TX. Understanding dropouts in MOOCs. In: Proceedings of the AAAI conference on artificial intelligence Honolulu HI USA vol. 33 27 January\u20131 February 2019 pp.517\u2013524.\u00a0Palo Alto California USA: The Association for the Advancement of Artificial Intelligence (AAAI).","DOI":"10.1609\/aaai.v33i01.3301517"},{"key":"e_1_3_2_59_2","volume-title":"Practical nonparametric statistics","author":"Conover WJ","year":"1999","unstructured":"Conover WJ. Practical nonparametric statistics, 3rd ed. New York: Wiley, 1999.","edition":"3"}],"container-title":["Journal of High Speed Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/09266801251388373","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/09266801251388373","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/09266801251388373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:42:41Z","timestamp":1777452161000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/09266801251388373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1177\/09266801251388373"],"URL":"https:\/\/doi.org\/10.1177\/09266801251388373","relation":{},"ISSN":["0926-6801","1875-8940"],"issn-type":[{"value":"0926-6801","type":"print"},{"value":"1875-8940","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}