{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:40:26Z","timestamp":1782834026127,"version":"3.54.5"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"publisher","award":["215E342"],"award-info":[{"award-number":["215E342"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tnet.2020.3025904","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T20:15:12Z","timestamp":1601669712000},"page":"2836-2849","source":"Crossref","is-referenced-by-count":9,"title":["Thompson Sampling for Combinatorial Network Optimization in Unknown Environments"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5621-5698","authenticated-orcid":false,"given":"Alihan","family":"Huyuk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4361-4021","authenticated-orcid":false,"given":"Cem","family":"Tekin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1760","article-title":"Combinatorial semi-bandits with knapsacks","author":"sankararaman","year":"2018","journal-title":"Proc 21st Int Conf Artif Intell Statist"},{"key":"ref38","first-page":"2116","article-title":"Combinatorial bandits revisited","author":"combes","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","first-page":"1450","article-title":"Combinatorial cascading bandits","author":"kveton","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","first-page":"548","article-title":"An optimal algorithm for stochastic matroid bandit optimization","author":"talebi","year":"2016","journal-title":"Proc Int Conf Auton Agents Multi-Agent Syst"},{"key":"ref31","first-page":"420","article-title":"Matroid bandits: Fast combinatorial optimization with learning","author":"kveton","year":"2014","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8308614"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0598"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2866334"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.53"},{"key":"ref34","first-page":"1245","article-title":"Contextual combinatorial cascading bandits","author":"li","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref40","article-title":"Regret bounds for stochastic combinatorial multi-armed bandits with linear space complexity","author":"agarwal","year":"2018","journal-title":"arXiv 1811 11925"},{"key":"ref11","first-page":"39.1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Proc 25th Annu Conf Learn Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref15","first-page":"2249","article-title":"An empirical evaluation of Thompson sampling","volume":"2011","author":"chapelle","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/asmb.874"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"ref18","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"2015","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref19","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","author":"chen","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref28","first-page":"5114","article-title":"Thompson sampling for combinatorial semi-bandits","author":"wang","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref4","first-page":"767","article-title":"Cascading bandits: Learning to rank in the cascade model","author":"kveton","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2563397"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2828415"},{"key":"ref29","first-page":"2465","article-title":"Batch-size independent regret bounds for the combinatorial multi-armed bandit problem","author":"merlis","year":"2019","journal-title":"Proc 32nd Annu Conf Learn Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2050490"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2290714"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref1","first-page":"1322","article-title":"Analysis of Thompson sampling for combinatorial multi-armed bandit with probabilistically triggered arms","author":"h\u00fcy\u00fck","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref46","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","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":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref22","first-page":"1161","article-title":"Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications","author":"wang","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref42","first-page":"901","article-title":"Combinatorial partial monitoring game with linear feedback and its applications","author":"lin","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref24","article-title":"Stochastic online learning with probabilistic graph feedback","author":"li","year":"2019","journal-title":"arXiv 1903 01083"},{"key":"ref41","article-title":"Top-k combinatorial bandits with full-bandit feedback","author":"rejwan","year":"2019","journal-title":"arXiv 1905 12624"},{"key":"ref23","article-title":"Information directed sampling for stochastic bandits with graph feedback","author":"liu","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref26","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":"ref43","first-page":"1486","article-title":"Contextual combinatorial volatile multi-armed bandit with adaptive discretization","author":"nika","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref25","first-page":"467","article-title":"Bandits with side observations: Bounded vs. logarithmic regret","author":"degenne","year":"2018","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9295473\/09211743.pdf?arnumber=9211743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:42:05Z","timestamp":1651070525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9211743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":48,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2020.3025904","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}