{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:16:58Z","timestamp":1770351418119,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1802302"],"award-info":[{"award-number":["2018YFB1802302"]}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1824518"],"award-info":[{"award-number":["CNS-1824518"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0087"],"award-info":[{"award-number":["W911NF-17-1-0087"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cloud Comput."],"published-print":{"date-parts":[[2022,10,1]]},"DOI":"10.1109\/tcc.2020.3046883","type":"journal-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T20:51:24Z","timestamp":1608756684000},"page":"2264-2280","source":"Crossref","is-referenced-by-count":18,"title":["A Fast Graph Neural Network-Based Method for Winner Determination in Multi-Unit Combinatorial Auctions"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7686-0507","authenticated-orcid":false,"given":"Mengyuan","family":"Lee","sequence":"first","affiliation":[{"name":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4266-4000","authenticated-orcid":false,"given":"Seyyedali","family":"Hosseinalipour","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2771-3521","authenticated-orcid":false,"given":"Christopher G.","family":"Brinton","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1354-2557","authenticated-orcid":false,"given":"Guanding","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0078-4891","authenticated-orcid":false,"given":"Huaiyu","family":"Dai","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2007070101"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2010.5470908"},{"key":"ref32","first-page":"123","article-title":"Machine learning based resource allocation of cloud computing in auction","volume":"56","author":"zhang","year":"2018","journal-title":"Computers Materials and Continua"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2843359"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"ref36","article-title":"Graph neural networks: A review of methods and applications","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.123"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2013.9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.39"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2541150"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2415776"},{"key":"ref13","first-page":"299","article-title":"Limitations of the vickrey auction in computational multiagent systems","author":"sandholm","year":"1996","journal-title":"Proc Int Conf Multiagent Syst"},{"key":"ref14","first-page":"548","article-title":"Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches","author":"fujishima","year":"1999","journal-title":"Proc 16th Int Joint Conf Artif Intell"},{"key":"ref15","first-page":"56","article-title":"An algorithm for multi-unit combinatorial auctions","author":"leyton-brown","year":"2000","journal-title":"Proc 17th Nat Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00015-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0336"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352872"},{"key":"ref19","first-page":"22","article-title":"Solving combinatorial auctions using stochastic local search","author":"hoos","year":"2000","journal-title":"Proc 17th Nat Conf Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2581179"},{"key":"ref27","first-page":"536","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/3003463"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.140"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3040983"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195615"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/EWSDN.2016.16"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2721957"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/inte.1040.0075"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.12.006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.8.1131"},{"key":"ref45","volume":"24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref22","first-page":"3293","article-title":"Learning to search in branch and bound algorithms","author":"he","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref21","first-page":"98","article-title":"Some tractable combinatorial auctions","author":"tennenholtz","year":"2000","journal-title":"Proc 17th Nat Conf Artif Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_17"},{"key":"ref24","first-page":"15554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","author":"gasse","year":"2019","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2004.03.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2953724"},{"key":"ref44","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"Proc 3rd Int Conf Learn Representations"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3031920"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010074"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104781"}],"container-title":["IEEE Transactions on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6245519\/9970353\/9305731-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245519\/9970353\/09305731.pdf?arnumber=9305731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:12:10Z","timestamp":1672081930000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9305731\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,1]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcc.2020.3046883","relation":{},"ISSN":["2168-7161","2372-0018"],"issn-type":[{"value":"2168-7161","type":"electronic"},{"value":"2372-0018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,1]]}}}