{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:44:59Z","timestamp":1782798299618,"version":"3.54.5"},"reference-count":63,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571205","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Constraint-Aware Combinatorial Bandits: Theoretical Foundations and Network Applications"],"prefix":"10.1109","author":[{"given":"Xiangxiang","family":"Dai","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[{"name":"Southeast University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xutong","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anqi","family":"Yu","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3673660.3655050"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621257"},{"issue":"1","key":"ref4","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485906"},{"key":"ref6","article-title":"Pond: Pessimistic-optimistic online dispatching","author":"Liu","year":"2020"},{"key":"ref7","first-page":"17183","article-title":"Learning policies with zero or bounded constraint violation for constrained mdps","volume-title":"Proc. NeurIPS","volume":"34","author":"Liu"},{"key":"ref8","first-page":"24075","article-title":"An efficient pessimistic-optimistic algorithm for stochastic linear bandits with general constraints","volume-title":"Proc. NeurIPS","volume":"34","author":"Liu"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1840"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400228"},{"key":"ref12","first-page":"1245","article-title":"Contextual combinatorial cascading bandits","volume-title":"Proc. ICML","author":"Li"},{"key":"ref13","article-title":"Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications","volume-title":"Proc. NeurIPS","volume":"30","author":"Wang"},{"key":"ref14","first-page":"1760","article-title":"Combinatorial semi-bandits with knapsacks","volume-title":"Proc. AISTATS","author":"Sankararaman"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/459"},{"key":"ref16","first-page":"191","article-title":"Submodular bandit problem under multiple constraints","volume-title":"Proc. UAI","author":"Takemori"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref20","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","volume-title":"Proc. AISTATS","author":"Kveton"},{"key":"ref21","article-title":"Combinatorial bandits revisited","volume-title":"Proc. NeurIPS","volume":"28","author":"Combes"},{"key":"ref22","first-page":"767","article-title":"Cascading bandits: Learning to rank in the cascade model","volume-title":"Proc. ICML","author":"Kveton"},{"key":"ref23","first-page":"1450","article-title":"Combinatorial cascading bandits","volume-title":"Proc. NeurIPS","volume":"28","author":"Kveton"},{"key":"ref24","article-title":"Online influence maximization under independent cascade model with semi-bandit feedback","volume-title":"Proc. NeurIPS","volume":"30","author":"Wen"},{"key":"ref25","first-page":"420","article-title":"Matroid bandits: fast combinatorial optimization with learning","volume-title":"Proc. UAI","author":"Kveton"},{"key":"ref26","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","volume-title":"Proc. ICML","author":"Chen"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8637"},{"key":"ref28","first-page":"433","article-title":"Algorithms with logarithmic or sublinear regret for constrained contextual bandits","volume-title":"Proc. NeurIPS","volume":"28","author":"Wu"},{"key":"ref29","first-page":"2210","article-title":"Budgeted multi-armed bandits with multiple plays","volume-title":"Proc. IJCAI","author":"Xia"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737461"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"key":"ref33","article-title":"Dependent randomized rounding for matroid polytopes and applications","author":"Chekuri","year":"2009"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"ref35","first-page":"2273","article-title":"Dependent randomized rounding for clustering and partition systems with knapsack constraints","volume-title":"Proc. AISTATS","author":"Harris"},{"key":"ref36","first-page":"182","article-title":"Maximizing a submodular set function subject to a matroid constraint","volume-title":"Proc. IPCO","author":"Calinescu"},{"key":"ref37","article-title":"Continuous submodular function maximization","author":"Bian","year":"2020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3711896.3736824"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2024.3519568"},{"issue":"1","key":"ref40","first-page":"2503","article-title":"Trading regret for efficiency: online convex optimization with long term constraints","volume":"13","author":"Mahdavi","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3173792"},{"key":"ref42","article-title":"Approximation schemes for 0-1 knapsack","volume-title":"Proc. SOSA","author":"Chan"},{"key":"ref43","article-title":"Multi-agent conversational online learning for adaptive llm response identification","author":"Dai","year":"2025"},{"key":"ref44","article-title":"Investlm: A large language model for investment using financial domain instruction tuning","author":"Yang","year":"2023"},{"key":"ref45","article-title":"Frugalgpt: How to use large language models while reducing cost and improving performance","author":"Chen","year":"2023"},{"key":"ref46","article-title":"Cost-effective online multi-llm selection with versatile reward models","author":"Dai","year":"2024"},{"key":"ref47","article-title":"Poe","year":"2025"},{"key":"ref48","article-title":"Dynamic llm-agent network: An llm-agent collaboration framework with agent team optimization","author":"Liu","year":"2023"},{"key":"ref49","article-title":"Awan","year":"2025"},{"key":"ref50","article-title":"JDCloud","year":"2025"},{"key":"ref51","article-title":"An explanation of in-context learning as implicit bayesian inference","author":"Xie","year":"2021"},{"key":"ref52","article-title":"The matrix: A bayesian learning model for llms","author":"Dalal","year":"2024"},{"key":"ref53","article-title":"GUROBI","year":"2025"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3744970.3727279"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734219"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-4413"},{"key":"ref59","article-title":"OpenAI LLM API","year":"2025"},{"key":"ref60","article-title":"Claude AI LLM API","year":"2025"},{"key":"ref61","article-title":"Wenxin","year":"2025"},{"key":"ref62","article-title":"Ollama","year":"2025"},{"key":"ref63","article-title":"Mistral","year":"2025"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571205.pdf?arnumber=11571205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:18:27Z","timestamp":1782796707000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571205\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571205","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}