{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T21:53:43Z","timestamp":1781819623975,"version":"3.54.5"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation Project of P. R. China","award":["(No. 61931001"],"award-info":[{"award-number":["(No. 61931001"]}]},{"DOI":"10.13039\/501100022424","name":"Ministry of Scientific and Technological Development, Higher Education and Information Society","doi-asserted-by":"publisher","award":["No. BK20AF003"],"award-info":[{"award-number":["No. BK20AF003"]}],"id":[{"id":"10.13039\/501100022424","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00607-023-01160-2","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T15:02:26Z","timestamp":1674658946000},"page":"1497-1522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Many-to-many matching based task allocation for dispersed computing"],"prefix":"10.1007","volume":"105","author":[{"given":"Hongwen","family":"Hui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuhong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xianwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"issue":"7","key":"1160_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/MCOM.2019.1800776","volume":"57","author":"MR Schurgot","year":"2019","unstructured":"Schurgot MR, Wang M, Conway AE, Greenwald LG, Lebling PD (2019) A dispersed computing architecture for resource-centric computation and communication. IEEE Commun Mag 57(7):13\u201319","journal-title":"IEEE Commun Mag"},{"issue":"4","key":"1160_CR2","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/TNET.2019.2919553","volume":"27","author":"CS Yang","year":"2019","unstructured":"Yang CS, Pedarsani R, Avestimehr AS (2019) Communication-aware scheduling of serial tasks for dispersed computing. IEEE ACM Trans Network 27(4):1330\u20131343","journal-title":"IEEE ACM Trans Network"},{"key":"1160_CR3","doi-asserted-by":"crossref","unstructured":"Knezevic A, Nguyen Q, Tran JA, Ghosh P, Annavaram M (2017) CIRCE-a runtime scheduler for DAG-based dispersed computing. In: Proceedings of the 2nd ACM\/IEEE symposium on edge computing, San Jose\/Silicon Valley, CA, USA, pp 1\u20132","DOI":"10.1145\/3132211.3132451"},{"key":"1160_CR4","doi-asserted-by":"crossref","unstructured":"Conway AE, Wang M, Ljuca E, Lebling PD (2020) A Dynamic Transport Overlay System for Mission-Oriented Dispersed Computing Over IoBT. In: MILCOM 2019\u20132019 IEEE military communications conference (MILCOM), Norfolk, VA, USA, pp 815\u2013820","DOI":"10.1109\/MILCOM47813.2019.9020772"},{"key":"1160_CR5","doi-asserted-by":"crossref","unstructured":"Yang H, Li G, Sun G, et al (2021) Dispersed computing for tactical edge in future wars: vision, architecture, and challenges. Wirel Commun Mob Comput 2021:8899186:1-8899186:31","DOI":"10.1155\/2021\/8899186"},{"issue":"11","key":"1160_CR6","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1109\/TMC.2017.2679712","volume":"16","author":"YH Kao","year":"2017","unstructured":"Kao YH, Krishnamachari B, Ra MR, Bai F (2017) Hermes: latency optimal task assignment for resource-constrained mobile computing. IEEE T Mobile Comput 16(11):3056\u20133069","journal-title":"IEEE T Mobile Comput"},{"key":"1160_CR7","doi-asserted-by":"crossref","unstructured":"Wang H, Gong J, Zhuang Y, Shen H, Lach J (2017) Healthedge: task scheduling for edge computing with health emergency and human behavior consideration in smart homes. In: 2017 IEEE international conference on big data (big data), MA, USA, pp 1213\u20131222","DOI":"10.1109\/BigData.2017.8258047"},{"issue":"3","key":"1160_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10723-013-9266-3","volume":"11","author":"Y Gu","year":"2013","unstructured":"Gu Y, Wu CQ, Liu X, Yu D (2013) Distributed throughput optimization for large-scale scientific workflows under fault-tolerance constraint. J Grid Comput 11(3):361\u2013379","journal-title":"J Grid Comput"},{"key":"1160_CR9","doi-asserted-by":"crossref","unstructured":"Garc$$\\acute{\\i }$$a-Valls M, Dubey A, Botti V (2018) Introducing the new paradigm of social dispersed computing: applications, technologies and challenges. J Supercomput 91:83\u2013102","DOI":"10.1016\/j.sysarc.2018.05.007"},{"key":"1160_CR10","doi-asserted-by":"crossref","unstructured":"Hu D, Krishnamachari B (2019) Throughput optimized scheduler for dispersed computing systems. In: 7th IEEE international conference on mobile cloud computing, services, and engineering (MobileCloud), Newark, CA, USA, pp 76\u201384","DOI":"10.1109\/MobileCloud.2019.00018"},{"issue":"10","key":"1160_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.23919\/JCC.2021.10.016","volume":"18","author":"C Zhou","year":"2021","unstructured":"Zhou C, Gong C, Hui H, Lin F, Zeng G (2021) A task-resource joint management model with intelligent control for mission-aware dispersed computing. China Commun 18(10):214\u2013232","journal-title":"China Commun"},{"key":"1160_CR12","doi-asserted-by":"crossref","unstructured":"Ghosh P, Nguyen Q, Krishnamachari B (2019) Container orchestration for dispersed computing, In Proceedings of the 5th International Workshop on Container Technologies and Container Clouds, Davis, CA, USA, pp 19\u201324","DOI":"10.1145\/3366615.3368354"},{"issue":"3","key":"1160_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNET.2021.3056490","volume":"29","author":"M Zhang","year":"2021","unstructured":"Zhang M, Yang L, He S, Li M, Zhang J (2021) Privacy-preserving data aggregation for mobile crowdsensing with externality: an auction approach. IEEE ACM Trans Network 29(3):1","journal-title":"IEEE ACM Trans Network"},{"key":"1160_CR14","doi-asserted-by":"crossref","unstructured":"Krontiris I, Dimitriou T (2013) Privacy-respecting discovery of data providers in crowd-sensing applications. In: IEEE international conference on distributed computing in sensor systems, Cambridge MA, USA, pp 249\u2013257","DOI":"10.1109\/DCOSS.2013.31"},{"issue":"8","key":"1160_CR15","first-page":"32","volume":"10","author":"A Rohilla","year":"2017","unstructured":"Rohilla A, Khurana M, Singh L (2017) Location privacy using homomorphic encryption over cloud. Int J Comput Sci Net 10(8):32\u201340","journal-title":"Int J Comput Sci Net"},{"key":"1160_CR16","unstructured":"Andr$$\\acute{e}$$s ME, Bordenabe NE, Chatzikokolakis K, et al (2013) Geo-indistinguishability: differential privacy for location-based systems. In: Proceedings of the 2013 ACM SIGSAC conference on Computer and communications security, Xi\u2019an China, pp 901\u2013914"},{"key":"1160_CR17","doi-asserted-by":"crossref","unstructured":"Xie Z, Hu L, Huang Y, Pang J (2021) A semiopportunistic task allocation framework for mobile crowdsensing with deep learning. Wirel Commun Mob Comput 2021:6643229:1\u20136643229:15","DOI":"10.1155\/2021\/6643229"},{"key":"1160_CR18","doi-asserted-by":"crossref","unstructured":"Kazemi L, Shahabi C (2012) Geocrowd: enabling query answering with spatial crowdsourcing. In: Proceedings of the 20th international conference on advances in geographic information systems, Redondo Beach, CA, USA, USA, pp 189\u2013198","DOI":"10.1145\/2424321.2424346"},{"key":"1160_CR19","doi-asserted-by":"crossref","unstructured":"Wang L, Yang D, Han X, Wang T, Zhang D, Ma X (2017) Location privacy-preserving task allocation for mobile crowdsensing with differential geo-obfuscation. In: Proceedings of the 26th international conference on world wide web, Perth, Australia, pp 627\u2013636","DOI":"10.1145\/3038912.3052696"},{"key":"1160_CR20","doi-asserted-by":"crossref","unstructured":"Wang Z, Hu J, Zhao J, Yang D, Chen H, Wang Q (2018) Pay on-demand: dynamic incentive and task selection for location-dependent mobile crowdsensing systems. In: IEEE 38th international conference on distributed computing systems (ICDCS), Vienna, Austria, pp 611\u2013621","DOI":"10.1109\/ICDCS.2018.00066"},{"key":"1160_CR21","doi-asserted-by":"crossref","unstructured":"Gong W, Zhang B, Li C (2017) Location-based online task scheduling in mobile crowdsensing. In: GLOBECOM 2017\u20132017 IEEE Global Communications Conference, Singapore, pp 1\u20136","DOI":"10.1109\/GLOCOM.2017.8254735"},{"key":"1160_CR22","doi-asserted-by":"crossref","unstructured":"Khaluf Y, Birattari M, Hamann H (2014) A swarm robotics approach to task allocation under soft deadlines and negligible switching costs. In: International conference on simulation of adaptive behavior. Springer, Cham, pp 270\u2013279","DOI":"10.1007\/978-3-319-08864-8_26"},{"key":"1160_CR23","volume-title":"Applied probability models with optimization applications","author":"SM Ross","year":"2013","unstructured":"Ross SM (2013) Applied probability models with optimization applications. Courier Corporation, New York"},{"key":"1160_CR24","doi-asserted-by":"crossref","unstructured":"Vilaplana J, Solsona F, Teixid$$\\acute{o}$$ I, Mateo J, Abella F, Rius J (2014) A queuing theory model for cloud computing. J Supercomput 69(1):492\u2013507","DOI":"10.1007\/s11227-014-1177-y"},{"key":"1160_CR25","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.geb.2016.10.015","volume":"102","author":"Z Jiao","year":"2017","unstructured":"Jiao Z, Tian G (2017) The Blocking Lemma and strategy-proofness in many-to-many matchings. Games Econ Behav 102:44\u201355","journal-title":"Games Econ Behav"},{"issue":"9","key":"1160_CR26","first-page":"5","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(9):5","journal-title":"Am Math Mon"},{"issue":"3","key":"1160_CR27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"AE Roth","year":"2008","unstructured":"Roth AE (2008) Deferred acceptance algorithms: history, theory, practice, and open questions. Int J Game Theory 36(3):537\u2013569","journal-title":"Int J Game Theory"},{"issue":"6","key":"1160_CR28","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/TMC.2018.2861393","volume":"18","author":"Z Wang","year":"2018","unstructured":"Wang Z, Hu J, Lv R, Wei J, Wang Q, Yang D, Qi H (2018) Personalized privacy-preserving task allocation for mobile crowdsensing. IEEE Trans Mobile Comput 18(6):1330\u20131341","journal-title":"IEEE Trans Mobile Comput"},{"issue":"5","key":"1160_CR29","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCOM.2015.7105641","volume":"53","author":"Y Gu","year":"2015","unstructured":"Gu Y, Saad W, Bennis M, Debbah M, Han Z (2015) Matching theory for future wireless networks: fundamentals and applications. IEEE Commun Mag 53(5):52\u201359","journal-title":"IEEE Commun Mag"},{"key":"1160_CR30","doi-asserted-by":"crossref","unstructured":"Xu H, Li B (2011) Seen as stable marriages. In: Proceedings IEEE INFOCOM, Shanghai, China, pp 586\u2013590","DOI":"10.1109\/INFCOM.2011.5935232"},{"key":"1160_CR31","doi-asserted-by":"crossref","unstructured":"Hamidouche K, Saad W, Debbah M (2014) Many-to-many matching games for proactive social-caching in wireless small cell networks, In 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks(WiOpt). IEEE, Hammamet, Tunisia, pp 569\u2013574","DOI":"10.1109\/WIOPT.2014.6850348"},{"key":"1160_CR32","doi-asserted-by":"crossref","unstructured":"Zheng T, Chen J, Huang Y (2019) Task assignment in business processes based on completion rate evaluation. In: International conference on computer, network, communication and information systems (CNCI 2019). Atlantis Press, pp 326\u2013333","DOI":"10.2991\/cnci-19.2019.48"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01160-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01160-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01160-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T12:11:14Z","timestamp":1685535074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01160-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,25]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1160"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01160-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,25]]},"assertion":[{"value":"18 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We claim that we have no conflict of interest with other researchers with regard to the paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}