{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:09:35Z","timestamp":1778818175106,"version":"3.51.4"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115966","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T08:51:50Z","timestamp":1776243110000},"page":"115966","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Contextual combinatorial conservative bandits"],"prefix":"10.1016","volume":"1076","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9065-6852","authenticated-orcid":false,"given":"Xiaojin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Weiwen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shuai","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.115966_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000024","article-title":"Regret analysis of stochastic and nonstochastic multi-armed bandit problems","volume":"5","author":"Bubeck","year":"2012","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"10.1016\/j.tcs.2026.115966_bib0002","series-title":"AISTATS","first-page":"19","article-title":"Contextual bandit algorithms with supervised learning guarantees","author":"Beygelzimer","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0003","series-title":"Advances in Neural Information Processing Systems","first-page":"2249","article-title":"An empirical evaluation of thompson sampling","author":"Chapelle","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0004","series-title":"Advances in Neural Information Processing Systems","first-page":"2483","article-title":"Linear submodular bandits and their application to diversified retrieval","author":"Yue","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0005","series-title":"Proceedings of the 22nd ACM International Conference on Conference on Information & Knowledge Management","first-page":"1587","article-title":"Automatic ad format selection via contextual bandits","author":"Tang","year":"2013"},{"key":"10.1016\/j.tcs.2026.115966_bib0006","series-title":"AAAI","first-page":"1380","article-title":"Linear submodular bandits with a knapsack constraint","author":"Yu","year":"2016"},{"key":"10.1016\/j.tcs.2026.115966_bib0007","series-title":"AAAI","first-page":"2746","article-title":"Efficient ordered combinatorial semi-bandits for whole-page recommendation","author":"Wang","year":"2017"},{"key":"10.1016\/j.tcs.2026.115966_bib0008","series-title":"Advances in Neural Information Processing Systems","first-page":"2447","article-title":"Contextual gaussian process bandit optimization","author":"Krause","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0009","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1106","article-title":"Networked bandits with disjoint linear payoffs","author":"Fang","year":"2014"},{"key":"10.1016\/j.tcs.2026.115966_bib0010","unstructured":"S. Vaswani, B. Kveton, Z. Wen, M. Ghavamzadeh, L. Lakshmanan, M. Schmidt, Diffusion independent semi-bandit influence maximization, (2017). arXiv preprint arXiv: 1703.00557."},{"key":"10.1016\/j.tcs.2026.115966_bib0011","series-title":"Proceedings of the Fourth ACM International Conference on Web Search and Data Mining","first-page":"297","article-title":"Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms","author":"Li","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0012","series-title":"Proceedings of the 33rd International Conference on Machine Learning","first-page":"1254","article-title":"Conservative bandits","author":"Wu","year":"2016"},{"key":"10.1016\/j.tcs.2026.115966_bib0013","unstructured":"A. Kazerouni, M. Ghavamzadeh, B. Van Roy, Conservative Contextual Linear Bandits, (2016). arXiv preprint arXiv: 1611.06426."},{"key":"10.1016\/j.tcs.2026.115966_bib0014","series-title":"Herbert Robbins Selected Papers","first-page":"169","article-title":"Some aspects of the sequential design of experiments","author":"Robbins","year":"1985"},{"issue":"11","key":"10.1016\/j.tcs.2026.115966_bib0015","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TAC.1987.1104491","article-title":"Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: IID rewards","volume":"32","author":"Anantharam","year":"1987","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"5","key":"10.1016\/j.tcs.2026.115966_bib0016","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1109\/TNET.2011.2181864","article-title":"Combinatorial network optimization with unknown variables: multi-armed bandits with linear rewards and individual observations","volume":"20","author":"Gai","year":"2012","journal-title":"IEEE\/ACM Trans. Network. (TON)"},{"key":"10.1016\/j.tcs.2026.115966_bib0017","series-title":"Proceedings of the 30th International Conference on Machine Learning","first-page":"151","article-title":"Combinatorial multi-armed bandit: general framework, results and applications","author":"Chen","year":"2013"},{"key":"10.1016\/j.tcs.2026.115966_bib0018","series-title":"Advances in Neural Information Processing Systems","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","author":"Chen","year":"2014"},{"key":"10.1016\/j.tcs.2026.115966_bib0019","series-title":"ICML","first-page":"901","article-title":"Combinatorial partial monitoring game with linear feedback and its applications","author":"Lin","year":"2014"},{"key":"10.1016\/j.tcs.2026.115966_bib0020","series-title":"AISTATS","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"Kveton","year":"2015"},{"issue":"50","key":"10.1016\/j.tcs.2026.115966_bib0021","first-page":"1","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":"10.1016\/j.tcs.2026.115966_bib0022","series-title":"Advances in Neural Information Processing Systems","first-page":"817","article-title":"The epoch-greedy algorithm for multi-armed bandits with side information","author":"Langford","year":"2008"},{"key":"10.1016\/j.tcs.2026.115966_bib0023","series-title":"Advances in Neural Information Processing Systems","first-page":"586","article-title":"Parametric bandits: the generalized linear case","author":"Filippi","year":"2010"},{"key":"10.1016\/j.tcs.2026.115966_bib0024","series-title":"Proceedings of the 19th International Conference on World Wide Web","first-page":"661","article-title":"A contextual-bandit approach to personalized news article recommendation","author":"Li","year":"2010"},{"key":"10.1016\/j.tcs.2026.115966_bib0025","series-title":"Advances in Neural Information Processing Systems","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"Abbasi-Yadkori","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0026","series-title":"AISTATS","first-page":"208","article-title":"Contextual bandits with linear payoff functions","volume":"15","author":"Chu","year":"2011"},{"key":"10.1016\/j.tcs.2026.115966_bib0027","series-title":"Proceedings of the 2014 SIAM international conference on data mining","first-page":"461","article-title":"Contextual combinatorial bandit and its application on diversified online recommendation","author":"Qin","year":"2014"},{"issue":"1","key":"10.1016\/j.tcs.2026.115966_bib0028","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","article-title":"Asymptotically efficient adaptive allocation rules","volume":"6","author":"Lai","year":"1985","journal-title":"Adv. Appl. Math."},{"issue":"04","key":"10.1016\/j.tcs.2026.115966_bib0029","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.2307\/1427934","article-title":"Sample mean based index policies by O (log n) regret for the multi-armed bandit problem","volume":"27","author":"Agrawal","year":"1995","journal-title":"Adv. Appl. Probab."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2026.115966_bib0030","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"10.1016\/j.tcs.2026.115966_bib0031","series-title":"International Conference on Machine Learning","first-page":"5114","article-title":"Thompson sampling for combinatorial semi-bandits","author":"Wang","year":"2018"},{"key":"10.1016\/j.tcs.2026.115966_bib0032","series-title":"The 22nd International Conference on Artificial Intelligence and Statistics","first-page":"1322","article-title":"Analysis of thompson sampling for combinatorial multi-armed bandit with probabilistically triggered arms","author":"Huyuk","year":"2019"},{"key":"10.1016\/j.tcs.2026.115966_bib0033","first-page":"26701","article-title":"The hardness analysis of thompson sampling for combinatorial semi-bandits with greedy oracle","volume":"34","author":"Kong","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.tcs.2026.115966_bib0034","series-title":"Proceedings of the 40th International Conference on Machine Learning","first-page":"22559","article-title":"Contextual combinatorial bandits with probabilistically triggered arms","volume":"202","author":"Liu","year":"2023"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:04Z","timestamp":1778815384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":34,"alternative-id":["S0304397526002252"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115966","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Contextual combinatorial conservative bandits","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115966","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115966"}}