{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:46:24Z","timestamp":1780368384350,"version":"3.54.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-04447-7","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T11:59:59Z","timestamp":1760615999000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Truthful and Pareto-Optimal Matching Mechanism for Preference-Aware Task Allocation in IoT-Based Mobile Crowdsourcing"],"prefix":"10.1007","volume":"6","author":[{"given":"Chattu","family":"Bhargavi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8747-1627","authenticated-orcid":false,"given":"Vikash Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"4447_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2023.102952","volume":"142","author":"D Suhag","year":"2023","unstructured":"Suhag D, Jha V. A comprehensive survey on mobile crowdsensing systems. J Syst Architect. 2023;142:102952.","journal-title":"J Syst Architect"},{"issue":"1","key":"4447_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s42486-022-00110-9","volume":"5","author":"A Ray","year":"2023","unstructured":"Ray A, Chowdhury C, Bhattacharya S, Roy S. A survey of mobile crowdsensing and crowdsourcing strategies for smart mobile device users. CCF Trans Pervasive Comput Interact. 2023;5(1):98\u2013123.","journal-title":"CCF Trans Pervasive Comput Interact"},{"key":"4447_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103315","author":"JW Kim","year":"2022","unstructured":"Kim JW, Edemacu K, Jang B. Privacy-preserving mechanisms for location privacy in mobile crowdsensing: a survey. J Netw Comput Appl. 2022. https:\/\/doi.org\/10.1016\/j.jnca.2021.103315.","journal-title":"J Netw Comput Appl"},{"key":"4447_CR4","doi-asserted-by":"publisher","first-page":"56587","DOI":"10.1109\/ACCESS.2018.2872722","volume":"6","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Sahoo B, Sharma S, Xue Z, Zomaya AY. Energy-efficient deployment of edge dataenters for mobile clouds in sustainable IoT. Ieee Access. 2018;6:56587\u201397.","journal-title":"Ieee Access"},{"key":"4447_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128993","volume":"618","author":"Y Wang","year":"2025","unstructured":"Wang Y, Li Y, Wang W, Duan P, Sai AMVV, Cai Z. Mobile crowdsourcing based on 5g and 6g: a survey. Neurocomputing. 2025;618:128993.","journal-title":"Neurocomputing"},{"key":"4447_CR6","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s12652-020-02844-9","volume":"13","author":"J Mukhopadhyay","year":"2022","unstructured":"Mukhopadhyay J, Singh VK, Pal A, Kumar A. A truthful budget feasible mechanism for IoT-based participatory sensing with incremental arrival of budget. J Ambient Intell Humaniz Comput. 2022;13:1107\u201324. https:\/\/doi.org\/10.1007\/s12652-020-02844-9.","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4447_CR7","doi-asserted-by":"publisher","first-page":"67976","DOI":"10.1109\/ACCESS.2022.3186095","volume":"10","author":"VK Singh","year":"2022","unstructured":"Singh VK, Jasti AS, Singh SK, Mishra S, Alkhayyat A. A quality aware multiunit double auction framework for iot-based mobile crowdsensing in strategic setting. IEEE Access. 2022;10:67976\u201399. https:\/\/doi.org\/10.1109\/ACCESS.2022.3186095.","journal-title":"IEEE Access"},{"issue":"4","key":"4447_CR8","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s12652-019-01219-z","volume":"11","author":"VK Singh","year":"2020","unstructured":"Singh VK, Mukhopadhyay S, Xhafa F, Sharma A. A budget feasible peer graded mechanism for iot-based crowdsourcing. J Ambient Intell Humaniz Comput. 2020;11(4):1531\u201351. https:\/\/doi.org\/10.1007\/s12652-019-01219-z.","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4447_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3162108","author":"J Xu","year":"2022","unstructured":"Xu J, Luo Z, Guan C, Yang D, Liu L, Zhang Y. Hiring a team from social network: Incentive mechanism design for two-tiered social mobile crowdsourcing. IEEE Trans Mobile Comput. 2022. https:\/\/doi.org\/10.1109\/TMC.2022.3162108.","journal-title":"IEEE Trans Mobile Comput"},{"key":"4447_CR10","first-page":"148","volume-title":"Advances in edge computing: massive parallel processing and applications","author":"VK Singh","year":"2020","unstructured":"Singh VK, Mukhopadhyay S, Xhafa F, Krause P. A quality-assuring, combinatorial auction based mechanism for IoT-based crowdsourcing. In: Advances in edge computing: massive parallel processing and applications. Amsterdam: IOS Press; 2020. p. 148\u201377."},{"key":"4447_CR11","doi-asserted-by":"publisher","first-page":"20383","DOI":"10.1109\/ACCESS.2017.2751304","volume":"5","author":"Z Duan","year":"2017","unstructured":"Duan Z, Tian L, Yan M, Cai Z, Han Q, Yin G. Practical incentive mechanisms for iot-based mobile crowdsensing systems. IEEE Access. 2017;5:20383\u201392.","journal-title":"IEEE Access"},{"issue":"2","key":"4447_CR12","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s12652-020-02844-9","volume":"13","author":"J Mukhopadhyay","year":"2022","unstructured":"Mukhopadhyay J, Singh VK, Mukhopadhyay S, Pal A, Kumar A. A truthful budget feasible mechanism for iot-based participatory sensing with incremental arrival of budget. J Ambient Intell Hum Comput. 2022;13(2):1107\u201324.","journal-title":"J Ambient Intell Hum Comput"},{"key":"4447_CR13","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s12652-019-01219-z","volume":"11","author":"VK Singh","year":"2020","unstructured":"Singh VK, Mukhopadhyay S, Xhafa F, Sharma A. A budget feasible peer graded mechanism for iot-based crowdsourcing. J Ambient Intell Hum Comput. 2020;11:1531\u201351.","journal-title":"J Ambient Intell Hum Comput"},{"key":"4447_CR14","doi-asserted-by":"crossref","unstructured":"Singer Y. Budget feasible mechanisms. In: 2010 IEEE 51st annual symposium on foundations of computer science, 2010. pp. 765\u2013774. IEEE.","DOI":"10.1109\/FOCS.2010.78"},{"issue":"5","key":"4447_CR15","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale D, Shapley LS. College admissions and the stability of marriage. Am Math Mon. 2013;120(5):386\u201391.","journal-title":"Am Math Mon"},{"key":"4447_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1017\/CBO9780511800481.012","volume":"10","author":"J Schummer","year":"2007","unstructured":"Schummer J, Vohra RV. Mechanism design without money. Algorithmic Game Theory. 2007;10:243\u201399.","journal-title":"Algorithmic Game Theory"},{"key":"4447_CR17","doi-asserted-by":"publisher","first-page":"9873","DOI":"10.1007\/s11042-023-16015-3","volume":"83","author":"V Kumar Singh","year":"2024","unstructured":"Kumar Singh V, Mishra S. A truthful mechanism for time-bound tasks in iot-based crowdsourcing with zero budget. Multimedia Tools Appl. 2024;83:9873\u201392.","journal-title":"Multimedia Tools Appl"},{"key":"4447_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1017\/CBO9780511800481.011","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N. Introduction to mechanism design. In: Nisan N, Roughgarden ETT, Vazirani VV, editors. Algorithmic game theory. New York: Cambridge University Press; 2007. p. 209\u201342."},{"key":"4447_CR19","unstructured":"Roughgarden T. CS269I: Incentives in computer science. Lecture #2: Stable Matching. 2016."},{"key":"4447_CR20","doi-asserted-by":"crossref","unstructured":"Singh VK, Mukhopadhyay S, Xhafa F, Sharma A, Roy A. Hiring expert consultants in e-healthcare: an analytics-based two sided matching approach. In: Transactions on computational collective intelligence XXX, Springer, Berlin; 2018. p. 178\u2013199.","DOI":"10.1007\/978-3-319-99810-7_9"},{"key":"4447_CR21","doi-asserted-by":"crossref","unstructured":"Segal-Halevi E, Hassidim A, Aumann Y. Muda: A truthful multi-unit double-auction mechanism. In: Proceedings of the AAAI conference on artificial intelligence, 2018;32.","DOI":"10.1609\/aaai.v32i1.11450"},{"key":"4447_CR22","unstructured":"Segal-Halevi E, Hassidim A, Aumann Y. Double auctions in markets for multiple kinds of goods, 2016. arXiv preprint arXiv:1604.06210."},{"issue":"10","key":"4447_CR23","doi-asserted-by":"publisher","first-page":"4497","DOI":"10.1109\/TII.2018.2791619","volume":"14","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Rodrigues JJ, Sahoo B, Dutkiewicz E. Sustainable service allocation using a metaheuristic technique in a fog server for industrial applications. IEEE Trans Industr Inf. 2018;14(10):4497\u2013506.","journal-title":"IEEE Trans Industr Inf"},{"issue":"1","key":"4447_CR24","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s11227-017-2133-4","volume":"74","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Sahoo B, Jena SK, Obaidat MS. An adaptive task allocation technique for green cloud computing. J Supercomput. 2018;74(1):370\u201385.","journal-title":"J Supercomput"},{"key":"4447_CR25","first-page":"48","volume":"20","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Sahoo B, Jayaraman PP, Jun S, Zomaya AY, et al. Energy-efficient vm-placement in cloud data center. Sustain Comput Inform Syst. 2018;20:48\u201355.","journal-title":"Sustain Comput Inform Syst"},{"key":"4447_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ins.2019.09.067","volume":"512","author":"S Wang","year":"2020","unstructured":"Wang S, Dang D. Incentive mechanism for the listing item task in crowdsourcing. Inf Sci. 2020;512:80\u201395.","journal-title":"Inf Sci"},{"issue":"1","key":"4447_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3487580","volume":"22","author":"J Xu","year":"2021","unstructured":"Xu J, Zhou Y, Chen G, Ding Y, Yang D, Liu L. Topic-aware incentive mechanism for task diffusion in mobile crowdsourcing through social network. ACM Trans Internet Technol (TOIT). 2021;22(1):1\u201323.","journal-title":"ACM Trans Internet Technol (TOIT)"},{"issue":"8","key":"4447_CR28","doi-asserted-by":"publisher","first-page":"8174","DOI":"10.1109\/TITS.2023.3266754","volume":"24","author":"N Zhang","year":"2023","unstructured":"Zhang N, Liu Z, Li F, Xu Z, Chen Z. Stable matching for crowdsourcing last-mile delivery. IEEE Trans Intell Transp Syst. 2023;24(8):8174\u201387.","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"4447_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118784","volume":"212","author":"D Pu","year":"2023","unstructured":"Pu D, Yuan G. Two-sided matching model considering multi-information fusion of stakeholders. Expert Syst Appl. 2023;212:118784.","journal-title":"Expert Syst Appl"},{"key":"4447_CR30","doi-asserted-by":"crossref","unstructured":"Cho S-H, Todo T, Yokoo M. Two-sided matching over social networks. In: IJCAI; 2022. p. 186\u2013193.","DOI":"10.24963\/ijcai.2022\/27"},{"key":"4447_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106427","volume":"93","author":"D Liang","year":"2020","unstructured":"Liang D, He X, Xu Z. Multi-attribute dynamic two-sided matching method of talent sharing market in incomplete preference ordinal environment. Appl Soft Comput. 2020;93:106427.","journal-title":"Appl Soft Comput"},{"issue":"11","key":"4447_CR32","doi-asserted-by":"publisher","first-page":"5341","DOI":"10.1287\/mnsc.2019.3469","volume":"66","author":"I Feigenbaum","year":"2020","unstructured":"Feigenbaum I, Kanoria Y, Lo I, Sethuraman J. Dynamic matching in school choice: efficient seat reassignment after late cancellations. Manage Sci. 2020;66(11):5341\u201361.","journal-title":"Manage Sci"},{"key":"4447_CR33","unstructured":"Hosseini H, Lisowski G, Pathak S. Two-sided manipulation games in stable matching markets, 2025. arXiv preprint arXiv:2506.00554."},{"key":"4447_CR34","unstructured":"Yahiro K, Yokoo M. Game theoretic analysis for two-sided matching with resource allocation. In: Proceedings of the 19th international conference on autonomous agents and multi agent systems, 2020;1548\u20131556."},{"key":"4447_CR35","volume":"45","author":"S Wicaksono","year":"2022","unstructured":"Wicaksono S, Lin X, Tavasszy LA. Market potential of bicycle crowdshipping: a two-sided acceptance analysis. Res Transp Bus Manag. 2022;45:100660.","journal-title":"Res Transp Bus Manag"},{"issue":"1","key":"4447_CR36","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10115-024-02209-0","volume":"67","author":"Z Deng","year":"2025","unstructured":"Deng Z, Yuan T, Yue Q, Liu X. One-to-many two-sided matching decision of logistics o2o platform considering the intermediary benefit. Knowl Inf Syst. 2025;67(1):689\u2013725.","journal-title":"Knowl Inf Syst"},{"key":"4447_CR37","first-page":"4851","volume":"36","author":"N Boehmer","year":"2022","unstructured":"Boehmer N, Heeger K, Niedermeier R. Theory of and experiments on minimally invasive stability preservation in changing two-sided matching markets. Proc AAAI Conf Artif Intell. 2022;36:4851\u20138.","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"4447_CR38","doi-asserted-by":"crossref","unstructured":"Hosseini H, Umar F, Vaish R. Two for one $$\\backslash $$ & one for all: Two-sided manipulation in matching markets, 2022. arXiv preprint arXiv:2201.08774.","DOI":"10.24963\/ijcai.2022\/46"},{"key":"4447_CR39","doi-asserted-by":"crossref","unstructured":"Zhang N, Chen Y, Qin L, Yu P, Li Y. A two-sided matching method of resources and tasks in competitive crowdsourcing platform oriented to workers\u2019 and employers\u2019 satisfaction. Behav Inf Technol, 2025;1\u201325.","DOI":"10.1080\/0144929X.2025.2517221"},{"key":"4447_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2025.3548672","author":"R Samanta","year":"2025","unstructured":"Samanta R, Ghosh SK, Das SK. Sosta: skill-oriented stable task assignment with bidirectional preferences in crowdsourcing. IEEE Trans Emerg Topics Comput. 2025. https:\/\/doi.org\/10.1109\/TETC.2025.3548672.","journal-title":"IEEE Trans Emerg Topics Comput"},{"issue":"4","key":"4447_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s42979-020-00244-6","volume":"1","author":"H Mai-Tan","year":"2020","unstructured":"Mai-Tan H, Pham-Nguyen H-N, Long NX, Minh QT. Mining urban traffic condition from crowd-sourced data. SN Comput Sci. 2020;1(4):225.","journal-title":"SN Comput Sci"},{"key":"4447_CR42","doi-asserted-by":"crossref","unstructured":"GC VJ, Mishra SK, Puthal D, Enhancing traffic flow through advanced aco mechanism. In: IEEE INFOCOM 2024-IEEE conference on computer communications workshops (INFOCOM WKSHPS); 2024, p. 1\u20136. IEEE.","DOI":"10.1109\/INFOCOMWKSHPS61880.2024.10620760"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04447-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04447-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04447-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T12:00:05Z","timestamp":1760616005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04447-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,16]]},"references-count":42,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["4447"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04447-7","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,16]]},"assertion":[{"value":"8 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"909"}}