{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:56:09Z","timestamp":1767848169817,"version":"3.49.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cogn. Commun. Netw."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/tccn.2016.2542078","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T23:10:22Z","timestamp":1458342622000},"page":"435-449","source":"Crossref","is-referenced-by-count":7,"title":["Blind Network Interdiction Strategies\u2014A Learning Approach"],"prefix":"10.1109","volume":"1","author":[{"given":"SaiDhiraj","family":"Amuru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. Michael","family":"Buehrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihaela van der","family":"Schaar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"679","article-title":"Contextual bandits with similarity information","author":"slivkins","year":"0","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref38","first-page":"1","article-title":"Lipschtiz bandits: Regret lower bounds and optimal algorithms","author":"magureanu","year":"0","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5684126"},{"key":"ref32","author":"stevens","year":"2011","journal-title":"TCP\/IP Illustrated Volume 1 The Protocols"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120405"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.046105"},{"key":"ref37","first-page":"1","article-title":"Nearly tight bounds for the continuum-armed bandit problem","author":"kleinberg","year":"0","journal-title":"Proc Neural Info Proc Sys"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref34","first-page":"501","article-title":"Determining the number of nodes for wireless sensor networks","author":"yang","year":"0","journal-title":"Proc Symp Emerging Technol Mobile Wireless Commun"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.2.184"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028494"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.243"},{"key":"ref12","article-title":"Multi-agent decentralized network interdiction games","author":"sreekumaran","year":"2015"},{"key":"ref13","first-page":"207","article-title":"Linear programming models for jamming attacks on network traffic flows","author":"tague","year":"0","journal-title":"Proc Int Symp Model Optim Mobile Ad-Hoc Wireless Netw (WiOpt)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814364"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2013.6798431"},{"key":"ref17","article-title":"Complex networks vulnerability to module-based attacks","author":"da cunha","year":"2015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6957154"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref28","author":"amuru","year":"2015","journal-title":"Blind Network Interdiction Strategies—A Learning Approach"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2014.252"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7179041"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2510643"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502322"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"ref5","first-page":"47","article-title":"A communications jamming taxonomy","volume":"14","author":"litchman","year":"2015","journal-title":"IEEE Secur Privacy"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.10039"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90236-R"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2451081"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.09.013"},{"key":"ref1","first-page":"1619","article-title":"Optimal jamming in digital communication—Impact of modulation","author":"amuru","year":"0","journal-title":"Proc Global Commun Conf"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933484"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref45","first-page":"1","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"0","journal-title":"Proc Artif Intell Statist (AISTATS) Conf"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref47","first-page":"1","article-title":"Combinatorial multi-armed bandit: General framework, results and applications","author":"chen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publ Math Debrecen"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.027"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2010.01.005"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_16"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdr004"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.066101"},{"key":"ref26","first-page":"46","article-title":"Spectral bandits for smooth graph functions","author":"valko","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056110"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.3386\/w16516","article-title":"Cascades in networks and aggregate volatility","author":"acemoglu","year":"2010"}],"container-title":["IEEE Transactions on Cognitive Communications and Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687307\/7491405\/07436818.pdf?arnumber=7436818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T08:11:13Z","timestamp":1692259873000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7436818\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":47,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tccn.2016.2542078","relation":{},"ISSN":["2332-7731"],"issn-type":[{"value":"2332-7731","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}