{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:38:02Z","timestamp":1777127882704,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T00:00:00Z","timestamp":1623110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T00:00:00Z","timestamp":1623110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062065"],"award-info":[{"award-number":["62062065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762091"],"award-info":[{"award-number":["61762091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61662088"],"award-info":[{"award-number":["61662088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00607-021-00962-6","type":"journal-article","created":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T20:04:06Z","timestamp":1623182646000},"page":"383-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Strategy-proof mechanism for online resource allocation in cloud and edge collaboration"],"prefix":"10.1007","volume":"104","author":[{"given":"Jixian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laixin","family":"Chi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xutao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"962_CR1","unstructured":"Alibaba (2020) Alibaba Live [Online]. https:\/\/www.aliyun.com\/product\/live"},{"issue":"29","key":"962_CR2","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E Angelelli","year":"2011","unstructured":"Angelelli E, Filippi C (2011) On the complexity of interval scheduling with a resource constraint. Theoret Comput Sci 412(29):3650\u20133657","journal-title":"Theoret Comput Sci"},{"key":"962_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.cor.2014.06.002","volume":"51","author":"E Angelelli","year":"2014","unstructured":"Angelelli E, Bianchessi N, Filippi C (2014) Optimal interval scheduling with a resource constraint. Comput Oper Res 51:268\u2013281","journal-title":"Comput Oper Res"},{"issue":"1","key":"962_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JHS-140483","volume":"20","author":"S Bharti","year":"2014","unstructured":"Bharti S, Pattanaik K (2014) Dynamic distributed flow scheduling for effective link utilization in data center networks. J High Speed Netw 20(1):1\u201310","journal-title":"J High Speed Netw"},{"key":"962_CR5","doi-asserted-by":"crossref","unstructured":"Carvalho G, Cabral B, Pereira V, Bernardino J (2021) Edge computing: current trends, research challenges and future directions. Computing 103:993\u20131023","DOI":"10.1007\/s00607-020-00896-5"},{"issue":"3","key":"962_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/JSAC.2018.2815360","volume":"36","author":"M Chen","year":"2018","unstructured":"Chen M, Hao Y (2018) Task offloading for mobile edge computing in software defined ultra-dense network. IEEE J Sel Areas Commun 36(3):587\u2013597","journal-title":"IEEE J Sel Areas Commun"},{"issue":"1","key":"962_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1613\/jair.5100","volume":"56","author":"X Chen","year":"2016","unstructured":"Chen X, Hu X, Liu T, Ma W, Qin T, Tang P, Wang C, Zheng B (2016) Efficient mechanism design for online scheduling. J Artif Intell Res 56(1):429\u2013461","journal-title":"J Artif Intell Res"},{"issue":"9","key":"962_CR8","doi-asserted-by":"publisher","first-page":"6103","DOI":"10.1109\/TII.2020.2974875","volume":"16","author":"S Deng","year":"2020","unstructured":"Deng S, Xiang Z, Zhao P, Taheri J, Gao H, Yin J, Zomaya AY (2020) Dynamical resource allocation in edge for trustable internet-of-things systems: a reinforcement learning method. IEEE Trans Ind Inf 16(9):6103\u20136113","journal-title":"IEEE Trans Ind Inf"},{"issue":"5","key":"962_CR9","doi-asserted-by":"publisher","first-page":"1907","DOI":"10.1109\/TMC.2020.2970698","volume":"20","author":"S Deng","year":"2021","unstructured":"Deng S, Xiang Z, Taheri J, Khoshkholghi MA, Yin J, Zomaya AY, Dustdar S (2021) Optimal application deployment in resource constrained distributed edges. IEEE Trans Mob Comput 20(5):1907\u20131923","journal-title":"IEEE Trans Mob Comput"},{"issue":"6","key":"962_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/MNET.011.2000089","volume":"34","author":"Q Duan","year":"2020","unstructured":"Duan Q, Wang S, Ansari N (2020) Convergence of networking and cloud\/edge computing: Status, challenges, and opportunities. IEEE Netw 34(6):148\u2013155","journal-title":"IEEE Netw"},{"issue":"1","key":"962_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MNET.2018.1700139","volume":"32","author":"H Guo","year":"2018","unstructured":"Guo H, Liu J, Qin H (2018) Collaborative mobile edge computation offloading for iot over fiber-wireless networks. IEEE Netw 32(1):66\u201371","journal-title":"IEEE Netw"},{"key":"962_CR12","unstructured":"Iimedia (2019) 2019q3 china online live broadcast industry development research report [Online]. https:\/\/www.iimedia.cn\/c400\/66897.html"},{"key":"962_CR13","doi-asserted-by":"crossref","unstructured":"Jiao Y, Wang P, Niyato D, Xiong Z (2018) Social welfare maximization auction in edge computing resource allocation for mobile blockchain. In: IEEE international conference on communications, pp 1\u20136","DOI":"10.1109\/ICC.2018.8422632"},{"key":"962_CR14","doi-asserted-by":"publisher","first-page":"69960","DOI":"10.1109\/ACCESS.2019.2919106","volume":"7","author":"K Li","year":"2019","unstructured":"Li K (2019) How to stabilize a competitive mobile edge computing environment: a game theoretic approach. IEEE Access 7:69960\u201369985","journal-title":"IEEE Access"},{"key":"962_CR15","doi-asserted-by":"crossref","unstructured":"Liu C, Li K, Liang J, Li K (2019) Cooper-match: job offloading with a cooperative game for guaranteeing strict deadlines in mec. IEEE Trans Mobile Comput. https:\/\/doi.org\/10.1109\/TMC.2019.2921713","DOI":"10.1109\/TMC.2019.2921713"},{"key":"962_CR16","doi-asserted-by":"crossref","unstructured":"Liu C, Li K, Liang J, Li K (2019) Cooper-sched: a cooperative scheduling framework for mobile edge computing with expected deadline guarantee. IEEE Trans Parallel Distrib Syst 1","DOI":"10.1109\/TPDS.2019.2921761"},{"issue":"7","key":"962_CR17","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TPDS.2017.2785815","volume":"29","author":"X Liu","year":"2018","unstructured":"Liu X, Li W, Zhang X (2018) Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans Parallel Distrib Syst 29(7):1650\u20131663","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"7","key":"962_CR18","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1109\/TC.2015.2479598","volume":"65","author":"L Mashayekhy","year":"2016","unstructured":"Mashayekhy L, Fisher N, Grosu D (2016) Truthful mechanisms for competitive reward-based scheduling. IEEE Trans Comput 65(7):2299\u20132312","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"962_CR19","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1109\/TC.2015.2444843","volume":"65","author":"L Mashayekhy","year":"2016","unstructured":"Mashayekhy L, Nejad M, Grosu D, Vasilakos A (2016) An online mechanism for resource allocation and pricing in clouds. IEEE Trans Comput 65(4):1172\u20131184","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"962_CR20","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"M Nejad","year":"2015","unstructured":"Nejad M, Mashayekhy L, Grosu D (2015) Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans Parallel Distrib Syst 26(2):594\u2013603","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"962_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen DT, Le LB, , Bhargava V (2018) Price-based resource allocation for edge computing: a market equilibrium approach. IEEE Trans Cloud Comput 9(1):302\u2013317","DOI":"10.1109\/TCC.2018.2844379"},{"key":"962_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"T Nisan","year":"2007","unstructured":"Nisan T, Roughgarden E, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge Univ. Press, Cambridge"},{"issue":"5","key":"962_CR23","doi-asserted-by":"publisher","first-page":"5031","DOI":"10.1109\/TVT.2019.2904244","volume":"68","author":"J Ren","year":"2019","unstructured":"Ren J, Yu G, He Y, Li GY (2019) Collaborative cloud and edge computing for latency minimization. IEEE Trans Veh Technol 68(5):5031\u20135044","journal-title":"IEEE Trans Veh Technol"},{"issue":"8","key":"962_CR24","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/JPROC.2019.2928287","volume":"107","author":"W Shi","year":"2019","unstructured":"Shi W, Pallis G, Xu Z (2019) Edge computing [scanning the issue]. Proc IEEE 107(8):1474\u20131481","journal-title":"Proc IEEE"},{"issue":"1\u20132","key":"962_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00607-014-0411-z","volume":"98","author":"B Song","year":"2016","unstructured":"Song B, Hassan MM, Alamri A, Alelaiwi A, Tian Y, Pathan M, Almogren A (2016) A two-stage approach for task and resource management in multimedia cloud environment. Computing 98(1\u20132):119\u2013145","journal-title":"Computing"},{"issue":"10","key":"962_CR26","doi-asserted-by":"publisher","first-page":"4692","DOI":"10.1109\/TII.2018.2855746","volume":"14","author":"W Sun","year":"2018","unstructured":"Sun W, Liu J, Yue Y, Zhang H (2018) Double auction-based resource allocation for mobile edge computing in industrial internet of things. IEEE Trans Ind Inf 14(10):4692\u20134701","journal-title":"IEEE Trans Ind Inf"},{"issue":"1","key":"962_CR27","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/TVT.2018.2881191","volume":"68","author":"Tuyen X Tran","year":"2018","unstructured":"Tran Tuyen X, Pompili D (2018) Joint task offloading and resource allocation for multi-server mobile-edge computing networks. IEEE Trans Veh Technol 68(1):856\u2013868","journal-title":"IEEE Trans Veh Technol"},{"issue":"10","key":"962_CR28","first-page":"4268","volume":"64","author":"Y Wang","year":"2016","unstructured":"Wang Y, Sheng M, Wang X, Wang L, Li J (2016) Mobile-edge computing: partial computation offloading using dynamic voltage scaling. IEEE Trans Commun 64(10):4268\u20134282","journal-title":"IEEE Trans Commun"},{"key":"962_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ins.2015.11.029","volume":"334","author":"Q Wu","year":"2016","unstructured":"Wu Q, Hao J (2016) A clique-based exact method for optimal winner determination in combinatorial auctions. Inf Sci 334:103\u2013121","journal-title":"Inf Sci"},{"key":"962_CR30","doi-asserted-by":"crossref","unstructured":"Xiang Z, Deng S, Jiang F, Gao H, Tehari J, Yin J (2020) Computing power allocation and traffic scheduling for edge service provisioning, pp 394\u2013403","DOI":"10.1109\/ICWS49710.2020.00058"},{"issue":"3","key":"962_CR31","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1109\/TWC.2016.2633522","volume":"16","author":"C You","year":"2016","unstructured":"You C, Huang K, Chae H, Kim BH (2016) Energy-efficient resource allocation for mobile-edge computation offloading. IEEE Trans Wirel Commun 16(3):1397\u20131411","journal-title":"IEEE Trans Wirel Commun"},{"key":"962_CR32","doi-asserted-by":"crossref","unstructured":"Zafari F, Li J, Leung KK, Towsley D, Swami A (2018) A game-theoretic approach to multi-objective resource sharing and allocation in mobile edge clouds. In: Technologies for the wireless edge workshop, pp 9\u201313","DOI":"10.1145\/3266276.3266277"},{"key":"962_CR33","doi-asserted-by":"publisher","first-page":"13455","DOI":"10.1109\/ACCESS.2017.2721957","volume":"5","author":"H Zhang","year":"2015","unstructured":"Zhang H, Guo F, Ji H, Zhu C (2015) Combinational auction-based service provider selection in mobile edge computing networks. IEEE Access 5:13455\u201313464","journal-title":"IEEE Access"},{"key":"962_CR34","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.future.2018.06.034","volume":"89","author":"J Zhang","year":"2018","unstructured":"Zhang J, Xie N, Zhang X, Li W (2018) An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost. Future Gener Comput Syst 89:286\u2013299","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"962_CR35","first-page":"123","volume":"56","author":"J Zhang","year":"2018","unstructured":"Zhang J, Xie N, Zhang X, Yue K, Li W, Kumar D (2018) Machine learning based resource allocation of cloud computing in auction. Comput Mater Contin 56(1):123\u2013135","journal-title":"Comput Mater Contin"},{"key":"962_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.future.2020.04.029","volume":"111","author":"J Zhang","year":"2020","unstructured":"Zhang J, Yang X, Xie N, Zhang X, Athanasios V, Li W (2020) An online auction mechanism for time-varying multidimensional resource allocation in clouds. Future Gener Comput Syst 111:27\u201338","journal-title":"Future Gener Comput Syst"},{"key":"962_CR37","doi-asserted-by":"crossref","unstructured":"Zhao H, Deng S, Liu Z, Xiang Z, Yin J, Dustdar S, Zomaya A (2021) Dpos: decentralized, privacy-preserving, and low-complexity online slicing for multi-tenant networks. IEEE Trans Mobile Comput. https:\/\/doi.org\/10.1109\/TMC.2021.3074934","DOI":"10.1109\/TMC.2021.3074934"},{"issue":"5","key":"962_CR38","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/s10586-018-02892-z","volume":"22","author":"H Zhou","year":"2019","unstructured":"Zhou H, Bai G, Deng S (2019) Optimal interval scheduling with nonidentical given machines. Clust Comput 22(5):1007\u20131015","journal-title":"Clust Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00962-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00962-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00962-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T15:04:56Z","timestamp":1643987096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00962-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,8]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["962"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00962-6","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,8]]},"assertion":[{"value":"23 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The codes generated or used during the study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}