{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T16:35:26Z","timestamp":1767976526745,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62062065"],"award-info":[{"award-number":["62062065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62062065"],"award-info":[{"award-number":["62062065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071417"],"award-info":[{"award-number":["12071417"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11227-023-05839-3","type":"journal-article","created":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T08:02:11Z","timestamp":1703750531000},"page":"10637-10666","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lowest revenue limit-based truthful auction mechanism for cloud resource allocation"],"prefix":"10.1007","volume":"80","author":[{"given":"Jixian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,28]]},"reference":[{"key":"5839_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E et al (2007) Algorithmic game theory. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511800481"},{"issue":"9","key":"5839_CR2","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2014.2355228","volume":"26","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy L, Nejad MM, Grosu D (2015) A ptas mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans Parallel Distrib Syst 26(9):2386\u20132399. https:\/\/doi.org\/10.1109\/TPDS.2014.2355228","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"5839_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TCC.2013.9","volume":"1","author":"S Zaman","year":"2013","unstructured":"Zaman S, Grosu D (2013) A combinatorial auction-based mechanism for dynamic VM provisioning and allocation in clouds. IEEE Trans Cloud Comput 1(2):129\u2013141. https:\/\/doi.org\/10.1109\/TCC.2013.9","journal-title":"IEEE Trans Cloud Comput"},{"issue":"1","key":"5839_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R Myerson","year":"1981","unstructured":"Myerson R (1981) Optimal auction design. Math Oper Res 6(1):58\u201373. https:\/\/doi.org\/10.1287\/moor.6.1.58","journal-title":"Math Oper Res"},{"issue":"4","key":"5839_CR5","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1109\/TMC.2020.3021416","volume":"21","author":"K Zhu","year":"2022","unstructured":"Zhu K, Xu Y, Jun Q et al (2022) Revenue-optimal auction for resource allocation in wireless virtualization: a deep learning approach. IEEE Trans Mob Comput 21(4):1374\u20131387. https:\/\/doi.org\/10.1109\/TMC.2020.3021416","journal-title":"IEEE Trans Mob Comput"},{"issue":"438","key":"5839_CR6","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.2307\/2235520","volume":"106","author":"D Levin","year":"1996","unstructured":"Levin D, Smith JL (1996) Optimal reservation prices in auctions. Econ J 106(438):1271\u20131283. https:\/\/doi.org\/10.2307\/2235520","journal-title":"Econ J"},{"issue":"6","key":"5839_CR7","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/mnsc.33.6.763","volume":"33","author":"R Engelbrecht-Wiggans","year":"1987","unstructured":"Engelbrecht-Wiggans R (1987) On optimal reservation prices in auctions. Manag Sci 33(6):763\u2013770. https:\/\/doi.org\/10.1287\/mnsc.33.6.763","journal-title":"Manag Sci"},{"issue":"2","key":"5839_CR8","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TNET.2014.2379281","volume":"24","author":"D Zhao","year":"2016","unstructured":"Zhao D, Li XY, Ma H (2016) Budget-feasible online incentive mechanisms for crowdsourcing tasks truthfully. IEEE-ACM Trans Netw 24(2):647\u2013661. https:\/\/doi.org\/10.1109\/TNET.2014.2379281","journal-title":"IEEE-ACM Trans Netw"},{"key":"5839_CR9","doi-asserted-by":"publisher","unstructured":"Singer Y (2010) Budget feasible mechanisms. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp 765\u2013774, https:\/\/doi.org\/10.1109\/FOCS.2010.78","DOI":"10.1109\/FOCS.2010.78"},{"issue":"2","key":"5839_CR10","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"MM Nejad","year":"2015","unstructured":"Nejad MM, 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. https:\/\/doi.org\/10.1109\/TPDS.2014.2308224","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5839_CR11","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 et al (2020) An online auction mechanism for time-varying multidimensional resource allocation in clouds. Futur Gener Comput Syst 111:27\u201338. https:\/\/doi.org\/10.1016\/j.future.2020.04.029","journal-title":"Futur Gener Comput Syst"},{"issue":"7","key":"5839_CR12","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. https:\/\/doi.org\/10.1109\/TC.2015.2479598","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"5839_CR13","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1109\/TC.2015.2444843","volume":"65","author":"L Mashayekhy","year":"2016","unstructured":"Mashayekhy L, Nejad MM, Grosu D et al (2016) An online mechanism for resource allocation and pricing in clouds. IEEE Trans Comput 65(4):1172\u20131184. https:\/\/doi.org\/10.1109\/TC.2015.2444843","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"5839_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TSC.2019.2924002","volume":"15","author":"Q Wang","year":"2022","unstructured":"Wang Q, Guo S, Liu J et al (2022) Profit maximization incentive mechanism for resource providers in mobile edge computing. IEEE Trans Serv Comput 15(1):138\u2013149. https:\/\/doi.org\/10.1109\/TSC.2019.2924002","journal-title":"IEEE Trans Serv Comput"},{"issue":"9","key":"5839_CR15","doi-asserted-by":"publisher","first-page":"1975","DOI":"10.1109\/TPDS.2019.2900238","volume":"30","author":"Y Jiao","year":"2019","unstructured":"Jiao Y, Wang P, Niyato D et al (2019) Auction mechanisms in cloud\/fog computing resource allocation for public blockchain networks. IEEE Trans Parallel Distrib Syst 30(9):1975\u20131989. https:\/\/doi.org\/10.1109\/TPDS.2019.2900238","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5839_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.future.2022.02.002","volume":"132","author":"J Zhang","year":"2022","unstructured":"Zhang J, Lou W, Sun H et al (2022) Truthful auction mechanisms for resource allocation in the internet of vehicles with public blockchain networks. Futur Gener Comput Syst Int J Esci 132:11\u201324. https:\/\/doi.org\/10.1016\/j.future.2022.02.002","journal-title":"Futur Gener Comput Syst Int J Esci"},{"key":"5839_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00607-021-00962-6","volume":"104","author":"J Zhang","year":"2022","unstructured":"Zhang J, Chi L, Xie N et al (2022) Strategy-proof mechanism for online resource allocation in cloud and edge collaboration. Computing 104:383\u2013412. https:\/\/doi.org\/10.1007\/s00607-021-00962-6","journal-title":"Computing"},{"issue":"2","key":"5839_CR18","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TCC.2022.3155495","volume":"11","author":"Y Su","year":"2023","unstructured":"Su Y, Fan W, Liu Y et al (2023) A truthful combinatorial auction mechanism towards mobile edge computing in industrial internet of things. IEEE Trans Cloud Comput 11(2):1678\u20131691. https:\/\/doi.org\/10.1109\/TCC.2022.3155495","journal-title":"IEEE Trans Cloud Comput"},{"issue":"7","key":"5839_CR19","doi-asserted-by":"publisher","first-page":"4832","DOI":"10.1109\/TII.2019.2960127","volume":"16","author":"J He","year":"2020","unstructured":"He J, Zhang D, Zhou Y et al (2020) A truthful online mechanism for collaborative computation offloading in mobile edge computing. IEEE Trans Ind Inf 16(7):4832\u20134841. https:\/\/doi.org\/10.1109\/TII.2019.2960127","journal-title":"IEEE Trans Ind Inf"},{"key":"5839_CR20","unstructured":"D\u00fctting P, Feng Z, Narasimhan H, et\u00a0al (2019) Optimal auctions through deep learning. In: International Conference on Machine Learning, PMLR, pp 1706\u20131715"},{"key":"5839_CR21","first-page":"34734","volume":"35","author":"D Ivanov","year":"2022","unstructured":"Ivanov D, Safiulin I, Filippov I et al (2022) Optimal-er auctions through attention. Adv Neural Inf Process Syst 35:34734\u201334747","journal-title":"Adv Neural Inf Process Syst"},{"key":"5839_CR22","unstructured":"Duan Z, Tang J, Yin Y, et\u00a0al (2022) A context-integrated transformer-based neural network for auction design. In: International Conference on Machine Learning, PMLR, pp 5609\u20135626"},{"key":"5839_CR23","doi-asserted-by":"publisher","unstructured":"Anari N, Goel G, Nikzad A (2014) Mechanism design for crowdsourcing: an optimal 1-1\/e competitive budget-feasible mechanism for large markets. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp 266\u2013275, https:\/\/doi.org\/10.1109\/FOCS.2014.36","DOI":"10.1109\/FOCS.2014.36"},{"issue":"9","key":"5839_CR24","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1109\/TMC.2016.2632721","volume":"16","author":"Z Zheng","year":"2017","unstructured":"Zheng Z, Wu F, Gao X et al (2017) A budget feasible incentive mechanism for weighted coverage maximization in mobile crowdsensing. IEEE Trans Mob Comput 16(9):2392\u20132407. https:\/\/doi.org\/10.1109\/TMC.2016.2632721","journal-title":"IEEE Trans Mob Comput"},{"key":"5839_CR25","doi-asserted-by":"publisher","unstructured":"Zhang J, Zhang Y, Wu H, et\u00a0al (2022) An ordered submodularity-based budget-feasible mechanism for opportunistic mobile crowdsensing task allocation and pricing. IEEE Trans Mobile Comput 1\u201318. https:\/\/doi.org\/10.1109\/TMC.2022.3232513","DOI":"10.1109\/TMC.2022.3232513"},{"issue":"2","key":"5839_CR26","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1257\/aer.20171408","volume":"108","author":"LM Ausubel","year":"2018","unstructured":"Ausubel LM (2018) An efficient ascending-bid auction for multiple objects: reply. Am Econ Rev 108(2):561\u2013563. https:\/\/doi.org\/10.1257\/aer.20171408","journal-title":"Am Econ Rev"},{"issue":"11","key":"5839_CR27","doi-asserted-by":"publisher","first-page":"4051","DOI":"10.1109\/TMC.2021.3063990","volume":"21","author":"A Chouayakh","year":"2022","unstructured":"Chouayakh A, Bechler A, Amigo I et al (2022) Multi-block ascending auctions for effective 5g licensed shared access. IEEE Trans Mob Comput 21(11):4051\u20134063. https:\/\/doi.org\/10.1109\/TMC.2021.3063990","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"5839_CR28","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1109\/TVT.2017.2744560","volume":"67","author":"C Yi","year":"2018","unstructured":"Yi C, Cai J (2018) Ascending-price progressive spectrum auction for cognitive radio networks with power-constrained multiradio secondary users. IEEE Trans Veh Technol 67(1):781\u2013794. https:\/\/doi.org\/10.1109\/TVT.2017.2744560","journal-title":"IEEE Trans Veh Technol"},{"issue":"2","key":"5839_CR29","doi-asserted-by":"publisher","first-page":"415","DOI":"10.7544\/issn1000-1239.2017.20160491","volume":"54","author":"Yang Xue TXDong Hongbin","year":"2017","unstructured":"Yang Xue TXDong Hongbin (2017) Budget constraint auction mechanism for online video advertisement. J Comput Res Dev 54(2):415. https:\/\/doi.org\/10.7544\/issn1000-1239.2017.20160491","journal-title":"J Comput Res Dev"},{"key":"5839_CR30","doi-asserted-by":"publisher","unstructured":"Dobzinski S, Lavi R, Nisan N (2008) Multi-unit auctions with budget limits. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp 260\u2013269, https:\/\/doi.org\/10.1109\/FOCS.2008.39","DOI":"10.1109\/FOCS.2008.39"},{"key":"5839_CR31","unstructured":"(2021) Huawei2021dataset@ONLINE. https:\/\/github.com\/yuuhqyks\/ramlrl"},{"key":"5839_CR32","unstructured":"(2022) Huawei2022cost@ONLINE. https:\/\/www.huaweicloud.com\/product\/ecs\/recommend.html"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05839-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05839-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05839-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T10:52:54Z","timestamp":1714992774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05839-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,28]]},"references-count":32,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["5839"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05839-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,28]]},"assertion":[{"value":"24 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2023","order":2,"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 conflicts of interest related to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}