{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:22:03Z","timestamp":1768256523113,"version":"3.49.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3124416","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T19:21:56Z","timestamp":1635535316000},"page":"151434-151443","source":"Crossref","is-referenced-by-count":3,"title":["Conservative Contextual Combinatorial Cascading Bandit"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4286-2605","authenticated-orcid":false,"given":"Kun","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"438","article-title":"A Thompson sampling algorithm for cascading bandits","author":"cheung","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.53"},{"key":"ref12","article-title":"Combinatorial semi-bandit with known covariance","author":"degenne","year":"2016","journal-title":"arXiv 1612 01859"},{"key":"ref13","first-page":"2447","article-title":"Contextual Gaussian process bandit optimization","author":"krause","year":"2011","journal-title":"Proc NIPS"},{"key":"ref14","first-page":"141","article-title":"Regret analysis of bandit problems with causal background knowledge","author":"lu","year":"2020","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref15","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"2015","journal-title":"Proc Artif Intell Statist"},{"key":"ref16","first-page":"141","article-title":"Interactive submodular bandit","author":"chen","year":"2017","journal-title":"Proc NIPS"},{"key":"ref17","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","author":"srinivas","year":"2009","journal-title":"arXiv 0912 3995"},{"key":"ref18","article-title":"Combinatorial multi-armed bandit with general reward functions","author":"chen","year":"2016","journal-title":"arXiv 1610 06603"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref4","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","author":"chen","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","article-title":"Contextual combinatorial conservative bandits","author":"zhang","year":"2019","journal-title":"arXiv 1911 11337"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"ref6","first-page":"767","article-title":"Cascading bandits: Learning to rank in the cascade model","author":"kveton","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref5","first-page":"1245","article-title":"Contextual combinatorial cascading bandits","author":"li","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume":"11","author":"abbasi-yadkori","year":"2011","journal-title":"Proc NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3001388"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref9","article-title":"Cascading bandits for large-scale recommendation problems","author":"zong","year":"2016","journal-title":"arXiv 1603 05359"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2870383"},{"key":"ref22","article-title":"SIC-MMAB: Synchronisation involves communication in multiplayer multi-armed bandits","author":"boursier","year":"2018","journal-title":"arXiv 1809 08151"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983847"},{"key":"ref24","article-title":"Conservative contextual linear bandits","author":"kazerouni","year":"2016","journal-title":"arXiv 1611 06426"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2307024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5812"},{"key":"ref25","first-page":"1254","article-title":"Conservative bandits","author":"wu","year":"2016","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09594856.pdf?arnumber=9594856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:03:46Z","timestamp":1662667426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9594856\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3124416","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}