{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:02:25Z","timestamp":1783569745123,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["No.61772385"],"award-info":[{"award-number":["No.61772385"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the social welfare and resource utilization. In our model, multiple cloud service providers and cloud users bid for various resources in a dynamic environment. We adopted a payment scheme to ensure truthfulness for all participants, which motivates bidders to reveal their true preferences. Since the combinatorial auction allocation with goal of economic efficiency is NP-hard, we developed a greedy mechanism to achieve the approximately efficient solution. Considering both parties\u2019 interests and the resource scarcity, this model also ensures fairness and balances resource allocation. The proposed model is proven to be approximately efficient, incentive compatible, individually rational and budget-balanced. Simulation results show that the model not only achieves economic efficiency, but also improves resource allocation and meets resource needs for more cloud users.<\/jats:p>","DOI":"10.1186\/s13677-023-00479-7","type":"journal-article","created":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T11:02:43Z","timestamp":1689678163000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A truthful dynamic combinatorial double auction model for cloud resource allocation"],"prefix":"10.1186","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0510-3610","authenticated-orcid":false,"given":"Qihui","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuanhe","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"479_CR1","doi-asserted-by":"publisher","unstructured":"Dillon T, Wu C, Chang E (2010) Cloud computing: issues and challenges. In: 24th IEEE International Conference on Advanced Information Networking and Applications. p 27\u201333. https:\/\/doi.org\/10.1109\/AINA.2010.187","DOI":"10.1109\/AINA.2010.187"},{"key":"479_CR2","doi-asserted-by":"publisher","unstructured":"Galante G, de Bona L (2012) A survey on cloud computing elasticity. In: IEEE Fifth International Conference on Utility and Cloud Computing, p 263\u2013270. https:\/\/doi.org\/10.1109\/UCC.2012.30","DOI":"10.1109\/UCC.2012.30"},{"key":"479_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TC.2013.106","volume":"63","author":"A Prasad","year":"2014","unstructured":"Prasad A, Rao S (2014) A mechanism design approach to resource procurement in cloud computing. IEEE Trans Comput 63:17\u201330. https:\/\/doi.org\/10.1109\/TC.2013.106","journal-title":"IEEE Trans Comput"},{"key":"479_CR4","doi-asserted-by":"publisher","unstructured":"Gu S, Li Z, Wu C, Huang C (2016) An efficient auction mechanism for service chains in the NFV market. In: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, p 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524438","DOI":"10.1109\/INFOCOM.2016.7524438"},{"key":"479_CR5","volume-title":"Game Theory and Information Economics","author":"W Zhang","year":"2005","unstructured":"Zhang W (2005) Game Theory and Information Economics. Shanghai People\u2019s Publishing House, Shanghai"},{"issue":"2","key":"479_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.future.2009.08.010","volume":"26","author":"H Izakian","year":"2010","unstructured":"Izakian H, Abraham A, Ladani BT (2010) An auction method for resource allocation in computational grids. Futur Gener Comput Syst 26(2):228\u2013235. https:\/\/doi.org\/10.1016\/j.future.2009.08.010","journal-title":"Futur Gener Comput Syst"},{"key":"479_CR7","volume-title":"A course in game theory","author":"Q Shen","year":"2010","unstructured":"Shen Q (2010) A course in game theory. China Renmin University Press, Beijing"},{"key":"479_CR8","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.tcs.2019.08.019","volume":"806","author":"G Liu","year":"2020","unstructured":"Liu G, Xiao Z, Tan G, Li K, Chronopoulos A (2020) Game theory-based optimization of distributed idle computing resources in cloud environments. Theoret Comput Sci 806:468\u2013488. https:\/\/doi.org\/10.1016\/j.tcs.2019.08.019","journal-title":"Theoret Comput Sci"},{"key":"479_CR9","doi-asserted-by":"publisher","first-page":"3041","DOI":"10.1109\/JIOT.2020.2964590","volume":"7","author":"Y Jie","year":"2020","unstructured":"Jie Y, Guo C, Choo K, Liu C, Li M (2020) Game-theoretic resource allocation for fog-based industrial internet of things environment. IEEE Internet Things J 7:3041\u20133052. https:\/\/doi.org\/10.1109\/JIOT.2020.2964590","journal-title":"IEEE Internet Things J"},{"key":"479_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/JSYST.2015.2451195","volume":"11","author":"T Lin","year":"2017","unstructured":"Lin T, Alpcan T, Hinton K (2017) A game-theoretic analysis of energy efficiency and performance for cloud computing in communication networks. IEEE Syst J 11:649\u2013660. https:\/\/doi.org\/10.1109\/JSYST.2015.2451195","journal-title":"IEEE Syst J"},{"key":"479_CR11","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TMC.2018.2847337","volume":"18","author":"J Zheng","year":"2019","unstructured":"Zheng J, Cai Y, Wu Y, Shen X (2019) Dynamic computation offloading for mobile cloud computing: a stochastic game-theoretic approach. IEEE Trans Mob Comput 18:771\u2013786. https:\/\/doi.org\/10.1109\/TMC.2018.2847337","journal-title":"IEEE Trans Mob Comput"},{"key":"479_CR12","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1109\/TCC.2016.2586048","volume":"8","author":"Y Chen","year":"2020","unstructured":"Chen Y, Wang L, Chen X, Ranjan R, Zomaya A, Zhou Y, Hu S (2020) Stochastic workload scheduling for uncoordinated datacenter clouds with multiple QoS constraints. IEEE Trans Cloud Comput 8:1284\u20131295. https:\/\/doi.org\/10.1109\/TCC.2016.2586048","journal-title":"IEEE Trans Cloud Comput"},{"key":"479_CR13","doi-asserted-by":"publisher","unstructured":"Guo J, Liu F, Zeng D, Lui J, Jin H (2013) A cooperative game based allocation for sharing data center networks. In: 2013 Proceedings IEEE INFOCOM, p 2139\u20132147. https:\/\/doi.org\/10.1109\/INFCOM.2013.6567016","DOI":"10.1109\/INFCOM.2013.6567016"},{"key":"479_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TCC.2018.2840999","volume":"9","author":"X Zhang","year":"2021","unstructured":"Zhang X, Huang Z, Wu C, Li Z, Lau F (2021) Dynamic VM scaling: Provisioning and pricing through an online auction. IEEE Trans Cloud Comput 9:131\u2013144. https:\/\/doi.org\/10.1109\/TCC.2018.2840999","journal-title":"IEEE Trans Cloud Comput"},{"key":"479_CR15","doi-asserted-by":"publisher","unstructured":"Li H, Wu C, Li Z, Lau F (2013) Profit-maximizing virtual machine trading in a federation of selfish clouds. In: 2013 Proceedings IEEE INFOCOM, p 25\u201329. https:\/\/doi.org\/10.1109\/INFCOM.2013.6566728","DOI":"10.1109\/INFCOM.2013.6566728"},{"key":"479_CR16","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TC.2015.2435784","volume":"65","author":"H Zhang","year":"2016","unstructured":"Zhang H, Jiang H, Li B, Liu F, Vasilakos A, Liu J (2016) A framework for truthful online auctions in cloud computing with heterogeneous user demands. IEEE Trans Comput 65:805\u2013818. https:\/\/doi.org\/10.1109\/TC.2015.2435784","journal-title":"IEEE Trans Comput"},{"key":"479_CR17","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.jss.2017.11.044","volume":"137","author":"S Tafsiri","year":"2018","unstructured":"Tafsiri S, Yousefi S (2018) Combinatorial double auction-based resource allocation mechanism in cloud computing market. J Syst Softw 137:322\u2013334. https:\/\/doi.org\/10.1016\/j.jss.2017.11.044","journal-title":"J Syst Softw"},{"key":"479_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TCC.2014.2369419","volume":"3","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy L, Nejad M, Grosu D (2015) Physical machine resource management in clouds: a mechanism design approach. IEEE Trans Cloud Comput 3:247\u2013260. https:\/\/doi.org\/10.1109\/TCC.2014.2369419","journal-title":"IEEE Trans Cloud Comput"},{"key":"479_CR19","doi-asserted-by":"publisher","unstructured":"Li Q, Huang C, Bao H, Fu B, Jia X (2019) A game-based combinatorial double auction model for cloud resource allocation. In: 2019 28th International Conference on Computer Communication and Networks ICCCN, p 1\u20138. https:\/\/doi.org\/10.1109\/ICCCN.2019.8846922","DOI":"10.1109\/ICCCN.2019.8846922"},{"key":"479_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13677-020-00213-7","volume":"9","author":"S Dibaj","year":"2020","unstructured":"Dibaj S, Miri A, Mostafavi S (2020) A cloud priority-based dynamic online double auction mechanism (pb-dodam). J Cloud Comput 9:1\u201326. https:\/\/doi.org\/10.1186\/s13677-020-00213-7","journal-title":"J Cloud Comput"},{"issue":"1","key":"479_CR21","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1007\/s11227-021-03918-x","volume":"78","author":"A Umer","year":"2022","unstructured":"Umer A, Nazir B, Ahmad Z (2022) Adaptive market-oriented combinatorial double auction resource allocation model in cloud computing. J Supercomput 78(1):1244\u20131286. https:\/\/doi.org\/10.1007\/s11227-021-03918-x","journal-title":"J Supercomput"},{"key":"479_CR22","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.32604\/cmc.2021.015445","volume":"69","author":"Z Ullah","year":"2021","unstructured":"Ullah Z, Umer A, Zaree M, Ahmad J, Alanazi F, Amin NU, Umar AI, Jehangiri AI, Adnan M (2021) Negotiation based combinatorial double auction mechanism in cloud computing. CMC-Comput Mater Contin 69:2123\u20132140. https:\/\/doi.org\/10.32604\/cmc.2021.015445","journal-title":"CMC-Comput Mater Contin"},{"issue":"2","key":"479_CR23","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s11227-010-0421-3","volume":"60","author":"YC Lee","year":"2012","unstructured":"Lee YC, Zomaya AY (2012) Energy efficient utilization of resources in cloud computing systems. J Supercomput 60(2):268\u2013280. https:\/\/doi.org\/10.1007\/s11227-010-0421-3","journal-title":"J Supercomput"},{"key":"479_CR24","doi-asserted-by":"publisher","first-page":"55923","DOI":"10.1109\/ACCESS.2018.2872750","volume":"6","author":"R Yadav","year":"2018","unstructured":"Yadav R, Zhang W, Kaiwartya O, Singh PR, Elgendy IA, Tian Y-C (2018) Adaptive energy-aware algorithms for minimizing energy consumption and SLA violation in cloud computing. IEEE Access 6:55923\u201355936. https:\/\/doi.org\/10.1109\/ACCESS.2018.2872750","journal-title":"IEEE Access"},{"key":"479_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jss.2018.03.003","volume":"140","author":"D Kumar","year":"2018","unstructured":"Kumar D, Baranwal G, Raza Z, Vidyarthi DP (2018) A truthful combinatorial double auction-based marketplace mechanism for cloud computing. J Syst Softw 140:91\u2013108. https:\/\/doi.org\/10.1016\/j.jss.2018.03.003","journal-title":"J Syst Softw"},{"key":"479_CR26","doi-asserted-by":"publisher","unstructured":"Baranwal G, Kumar D, Raza Z, Vidyarthi DP (2018) Double auction-based cloud resource provisioning. In: Auction Based Resource Provisioning in Cloud Computing, p 75\u201395. https:\/\/doi.org\/10.1007\/978-981-10-8737-0_5","DOI":"10.1007\/978-981-10-8737-0_5"},{"issue":"1\u20132","key":"479_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0004-3702(03)00015-8","volume":"145","author":"T Sandholm","year":"2003","unstructured":"Sandholm T, Suri S (2003) Bob: improved winner determination in combinatorial auctions and generalizations. Artif Intell 145(1\u20132):33\u201358. https:\/\/doi.org\/10.1016\/S0004-3702(03)00015-8","journal-title":"Artif Intell"},{"issue":"3","key":"479_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T Sandholm","year":"2005","unstructured":"Sandholm T, Suri S, Gilpin A, Levine D (2005) Cabob: a fast optimal algorithm for winner determination in combinatorial auctions. Manage Sci 51(3):374\u2013390. https:\/\/doi.org\/10.1287\/mnsc.1040.0336","journal-title":"Manage Sci"},{"issue":"5","key":"479_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D Lehmann","year":"2002","unstructured":"Lehmann D, O\u0107allaghan LI, Shoham Y (2002) Truth revelation in approximately efficient combinatorial auctions. JACM 49(5):577\u2013602. https:\/\/doi.org\/10.1145\/585265.585266","journal-title":"JACM"},{"issue":"4","key":"479_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jpdc.2012.12.006","volume":"73","author":"S Zaman","year":"2013","unstructured":"Zaman S, Grosu D (2013) Combinatorial auction-based allocation of virtual machine instances in clouds. J Parallel Distrib Comput 73(4):495\u2013508. https:\/\/doi.org\/10.1016\/j.jpdc.2012.12.006","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"479_CR31","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"MM Nejad","year":"2014","unstructured":"Nejad MM, Mashayekhy L, Grosu D (2014) 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":"479_CR32","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2014.02.008","volume":"357","author":"P Samimi","year":"2016","unstructured":"Samimi P, Teimouri Y, Mukhtar M (2016) A combinatorial double auction resource allocation model in cloud computing. Inf Sci 357:201\u2013216. https:\/\/doi.org\/10.1016\/j.ins.2014.02.008","journal-title":"Inf Sci"},{"issue":"1","key":"479_CR33","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(1):8\u201337. https:\/\/doi.org\/10.2307\/2977633","journal-title":"J Financ"},{"issue":"3","key":"479_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S1005-8885(08)60228-9","volume":"16","author":"L Li","year":"2009","unstructured":"Li L, Liu YA, Liu KM, Ma XL, Yang M (2009) Pricing in combinatorial double auction-based grid allocation model. J China Univ Posts Telecommun 16(3):59\u201365. https:\/\/doi.org\/10.1016\/S1005-8885(08)60228-9","journal-title":"J China Univ Posts Telecommun"},{"issue":"7","key":"479_CR35","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1016\/j.compeleceng.2012.12.018","volume":"39","author":"S Di","year":"2013","unstructured":"Di S, Wang C-L, Chen L (2013) Ex-post efficient resource allocation for self-organizing cloud. Comput Electr Eng 39(7):2342\u20132356. https:\/\/doi.org\/10.1016\/j.compeleceng.2012.12.018","journal-title":"Comput Electr Eng"},{"key":"479_CR36","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jss.2016.12.009","volume":"125","author":"D Kumar","year":"2017","unstructured":"Kumar D, Baranwal G, Raza Z, Vidyarthi DP (2017) A systematic study of double auction mechanisms in cloud computing. J Syst Softw 125:234\u2013255. https:\/\/doi.org\/10.1016\/j.jss.2016.12.009","journal-title":"J Syst Softw"},{"issue":"2","key":"479_CR37","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0531(92)90091-U","volume":"56","author":"RP McAfee","year":"1992","unstructured":"McAfee RP (1992) A dominant strategy double auction. J Econ Theory 56(2):434\u2013450. https:\/\/doi.org\/10.1016\/0022-0531(92)90091-U","journal-title":"J Econ Theory"},{"key":"479_CR38","volume-title":"Combinatorial Auctions","author":"P Cramton","year":"2006","unstructured":"Cramton P, Shoham Y, Steinberg R (2006) Combinatorial Auctions. MIT Press, Boston"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T11:05:43Z","timestamp":1689678343000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00479-7","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"2 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 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":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"106"}}