{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T15:44:22Z","timestamp":1761752662452,"version":"build-2065373602"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":14,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61872313"],"award-info":[{"award-number":["No.61872313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yangzhou Science and Technology","award":["No.YZU202103"],"award-info":[{"award-number":["No.YZU202103"]}]},{"name":"Science and Technology on Near-Surface Detection Laboratory","award":["No.6142414220509"],"award-info":[{"award-number":["No.6142414220509"]}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["No.KYCX24_3741"],"award-info":[{"award-number":["No.KYCX24_3741"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s44443-025-00268-z","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T12:23:45Z","timestamp":1760531025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NCAM-CS: neural combinatorial auction mechanisms with item complementarity and substitutability"],"prefix":"10.1007","volume":"37","author":[{"given":"Yuanyuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonglong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingxuan","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"268_CR1","doi-asserted-by":"crossref","unstructured":"Balcan M-F, Prasad S, Sandholm T (2025) Increasing revenue in efficient combinatorial auctions by learning to generate artificial competition. In: Proceedings of the AAAI conference on artificial intelligence vol 39, pp 13572\u201313580","DOI":"10.1609\/aaai.v39i13.33482"},{"key":"268_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6rgers T (2015) An Introduction to the Theory of Mechanism Design. Oxford University Press","DOI":"10.1093\/acprof:oso\/9780199734023.001.0001"},{"key":"268_CR3","doi-asserted-by":"crossref","unstructured":"Brero G, Lubin B, Seuken S (2020) Combinatorial auctions via machine learning-based preference elicitation. Machine Learning-powered Iterative Combinatorial Auctions","DOI":"10.1609\/aaai.v33i01.33011820"},{"key":"268_CR4","doi-asserted-by":"crossref","unstructured":"Clarke EH (1971) Multipart pricing of public goods. Public choice, pp 17\u201333","DOI":"10.1007\/BF01726210"},{"key":"268_CR5","unstructured":"Conitzer V, Sandholm T (2002) Complexity of mechanism design. arXiv:cs\/0205075"},{"key":"268_CR6","doi-asserted-by":"crossref","unstructured":"Conitzer V, Sandholm T (2004) Self-interested automated mechanism design and implications for optimal combinatorial auctions. In: Proceedings of the 5th ACM conference on electronic commerce, pp 132\u2013141","DOI":"10.1145\/988772.988793"},{"key":"268_CR7","first-page":"56169","volume":"36","author":"Z Duan","year":"2023","unstructured":"Duan Z, Sun H, Chen Y, Deng X (2023) A scalable neural network for dsic affine maximizer auction design. Adv Neural Inf Process Syst 36:56169\u201356185","journal-title":"Adv Neural Inf Process Syst"},{"key":"268_CR8","unstructured":"Duan Z, Tang J, Yin Y, Feng Z, Yan X, Zaheer M, Deng X (2022) A context-integrated transformer-based neural network for auction design. In: International Conference on Machine Learning, pp 5609\u20135626 . PMLR"},{"issue":"8","key":"268_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/3470442","volume":"64","author":"P D\u00fctting","year":"2021","unstructured":"D\u00fctting P, Feng Z, Narasimhan H, Parkes DC, Ravindranath SS (2021) Optimal auctions through deep learning. Commun ACM 64(8):109\u2013116","journal-title":"Commun ACM"},{"key":"268_CR10","unstructured":"Estermann B, Kramer S, Wattenhofer R, Wang Y (2023) Deep learning-powered iterative combinatorial auctions with active learning. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, pp 2919\u20132921"},{"key":"268_CR11","unstructured":"Feng Z, Narasimhan H, Parkes DC (2018) Deep learning for revenue-optimal auctions with budgets. In: Proceedings of the 17th international conference on autonomous agents and multiagent systems, pp 354\u2013362"},{"key":"268_CR12","doi-asserted-by":"crossref","unstructured":"Groves T (1973) Incentives in teams. Econometrica: Journal of the Econometric Society, pp 617\u2013631","DOI":"10.2307\/1914085"},{"key":"268_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2024.123556","volume":"369","author":"TD Hutty","year":"2024","unstructured":"Hutty TD, Brown S (2024) P2p trading of heat and power via a continuous double auction. Appl Energy 369:123556","journal-title":"Appl Energy"},{"key":"268_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.comcom.2021.11.025","volume":"185","author":"X Jiang","year":"2022","unstructured":"Jiang X, Sun Y, Liu B, Dou W (2022) Combinatorial double auction for resource allocation with differential privacy in edge computing. Comput Commun 185:13\u201322","journal-title":"Comput Commun"},{"key":"268_CR15","unstructured":"Kuo K, Ostuni A, Horishny E, Curry MJ, Dooley S, Chiang P-y, Goldstein T, Dickerson JP (2020) Proportionnet: Balancing fairness and revenue for auction design with deep learning. arXiv:2010.06398"},{"issue":"6","key":"268_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049697.2049699","volume":"58","author":"R Lavi","year":"2011","unstructured":"Lavi R, Swamy C (2011) Truthful and near-optimal mechanism design via linear programming. Journal of the ACM (JACM) 58(6):1\u201324","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"268_CR17","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1109\/TCC.2020.3046883","volume":"10","author":"M Lee","year":"2020","unstructured":"Lee M, Hosseinalipour S, Brinton CG, Yu G, Dai H (2020) A fast graph neural network-based method for winner determination in multi-unit combinatorial auctions. IEEE Trans Cloud Comput 10(4):2264\u20132280","journal-title":"IEEE Trans Cloud Comput"},{"key":"268_CR18","doi-asserted-by":"crossref","unstructured":"Li X, Wang Z, Zhu B, He F, Wang Y, Wang X (2024) Deep automated mechanism design for integrating ad auction and allocation in feed. In: Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval, pp 1211\u20131220","DOI":"10.1145\/3626772.3657774"},{"key":"268_CR19","doi-asserted-by":"crossref","unstructured":"Ma K, Kang C, Liu P, Yuan Y, Yang J, Li H (2024) Demand-side relay spectrum allocation in smart grid based on bilateral auction. IEEE Transactions on Industrial Informatics","DOI":"10.1109\/TII.2024.3424249"},{"issue":"1","key":"268_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson RB (1981) Optimal auction design. Math Oper Res 6(1):58\u201373","journal-title":"Math Oper Res"},{"key":"268_CR21","unstructured":"Pham M, Vaze V Chin P (2025) Advancing differentiable economics: A neural network framework for revenue-maximizing combinatorial auction mechanisms. arXiv:2501.19219"},{"key":"268_CR22","doi-asserted-by":"crossref","unstructured":"Rahme J, Jelassi S, Bruna J, Weinberg SM (2021) A permutation-equivariant neural network architecture for auction design. In: Proceedings of the AAAI Conference on Artificial Intelligence vol 35, pp 5664\u20135672","DOI":"10.1609\/aaai.v35i6.16711"},{"issue":"2","key":"268_CR23","first-page":"321","volume":"12","author":"K Roberts","year":"1979","unstructured":"Roberts K (1979) The characterization of implementable choice rules. Aggregation and Revelation of Preferences 12(2):321\u2013348","journal-title":"Aggregation and Revelation of Preferences"},{"issue":"5","key":"268_CR24","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1287\/opre.2015.1398","volume":"63","author":"T Sandholm","year":"2015","unstructured":"Sandholm T, Likhodedov A (2015) Automated design of revenue-maximizing combinatorial auctions. Oper Res 63(5):1000\u20131025","journal-title":"Oper Res"},{"key":"268_CR25","doi-asserted-by":"crossref","unstructured":"Soumalias EN, Weissteiner J, Heiss J, Seuken S (2024) Machine learning-powered combinatorial clock auction. In: Proceedings of the AAAI conference on artificial intelligence vol 38, pp 9891\u20139900","DOI":"10.1609\/aaai.v38i9.28850"},{"issue":"6","key":"268_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3701741","volume":"57","author":"X Tang","year":"2025","unstructured":"Tang X, Yu H (2025) Towards trustworthy ai-empowered real-time bidding for online advertisement auctioning. ACM Comput Surv 57(6):1\u201336","journal-title":"ACM Comput Surv"},{"key":"268_CR27","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. Advances in Neural Information Processing Systems 30"},{"issue":"1","key":"268_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(1):8\u201337","journal-title":"J Financ"},{"key":"268_CR29","doi-asserted-by":"crossref","unstructured":"Wang X, Wang X, Wang C, Zeng R, Ma L, He Q, Huang M (2025) Truthful online combinatorial auction-based mechanisms for task offloading in mobile edge computing. IEEE T Mobile, Comput","DOI":"10.1016\/j.comnet.2025.111767"},{"key":"268_CR30","doi-asserted-by":"crossref","unstructured":"Wu D, Wang X, Wang X, Yan S, He Q, Huang M (2025) Privacy-preserving and truthful auction-based resource allocation mechanisms for task offloading in mobile edge computing. Computer Networks, pp 111079","DOI":"10.1016\/j.comnet.2025.111079"},{"key":"268_CR31","volume-title":"Cadec: A combinatorial auction for dynamic distributed dnn inference scheduling in edge-cloud networks","author":"X Xu","year":"2025","unstructured":"Xu X, Hu Y, Cui G, Qi L, Dou W, Cai Z (2025) Cadec: A combinatorial auction for dynamic distributed dnn inference scheduling in edge-cloud networks. IEEE T Mobile, Comput"},{"key":"268_CR32","doi-asserted-by":"crossref","unstructured":"Yu J, Liu S, Zou Y, Wang G, Hu C (2025) Auction theory and game theory based pricing of edge computing resources: A survey. IEEE Internet of Things Journal","DOI":"10.1109\/JIOT.2025.3565539"},{"key":"268_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.107703","volume":"166","author":"H Zhang","year":"2025","unstructured":"Zhang H, Liu M, Chen Y, Zhao N (2025) Blockchain and timely auction mechanism-based spectrum management. Future Gen Comput Syst 166:107703","journal-title":"Future Gen Comput Syst"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00268-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T15:40:56Z","timestamp":1761752456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00268-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["268"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00268-z","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"29 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"256"}}