{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:41:40Z","timestamp":1743266500484,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9029186","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T04:43:11Z","timestamp":1584074591000},"page":"867-872","source":"Crossref","is-referenced-by-count":5,"title":["Combinatorial Bandits for Sequential Learning in Colonel Blotto Games"],"prefix":"10.1109","author":[{"given":"Dong Quan","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Loiseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alonso","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2369","article-title":"The on-line shortest path problem under partial monitoring","volume":"8","author":"gy\u00f6rgy","year":"2007","journal-title":"Journal of Machine Learning Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262750"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-011-0288-4"},{"key":"ref13","first-page":"2029","article-title":"Sequential classification-based optimization for direct policy search","author":"hu","year":"2017","journal-title":"AAAI"},{"article-title":"Zoopt\/zoojl: Toolbox for derivative-free optimization","year":"2017","author":"liu","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028557"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.03.011"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-005-0071-5"},{"key":"ref18","first-page":"585","article-title":"Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams","author":"sakaue","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref19","first-page":"232","article-title":"The heterogeneous Colonel Blotto game","author":"schwartz","year":"2014","journal-title":"NeTGCooP"},{"key":"ref4","article-title":"La théorie du jeu et les équations intégrales à noyau symétrique","volume":"173","author":"borel","year":"1921","journal-title":"Compte Rendus de l‘Academie des Sciences"},{"key":"ref3","first-page":"369","article-title":"Faster and simpler algorithm for optimal strategies of Blotto game","author":"behnezhad","year":"2017","journal-title":"AAAI"},{"key":"ref6","first-page":"201","article-title":"Colonel blotto in the phishing war","author":"chia","year":"2011","journal-title":"Games"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"ref8","article-title":"A continuous Colonel Blotto game","author":"gross","year":"1950","journal-title":"U S Air Force Project RAND Research Memorandum"},{"key":"ref7","first-page":"2116","article-title":"Combinatorial bandits revisited","author":"combes","year":"2015","journal-title":"NIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0598"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21500"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2014.6859164"},{"key":"ref20","article-title":"Path kernels and multiplicative updates","volume":"4","author":"takimoto","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029186"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/72"},{"article-title":"Colonel blotto and hide-and-seek games as path planning problems with side observations","year":"2019","author":"vu","key":"ref23"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","start":{"date-parts":[[2019,12,11]]},"location":"Nice, France","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09029186.pdf?arnumber=9029186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:25:47Z","timestamp":1658262347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9029186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9029186","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}