{"id":"https://openalex.org/W2903206604","doi":"https://doi.org/10.1145/3557045","title":"Adversarial Bandits with Knapsacks","display_name":"Adversarial Bandits with Knapsacks","publication_year":2022,"publication_date":"2022-08-18","ids":{"openalex":"https://openalex.org/W2903206604","doi":"https://doi.org/10.1145/3557045","mag":"2903206604"},"language":"en","primary_location":{"id":"doi:10.1145/3557045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3557045","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009111822","display_name":"Nicole Immorlica","orcid":"https://orcid.org/0000-0003-4180-4657"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicole Immorlica","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4180-4657","affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056358363","display_name":"Karthik Abinav Sankararaman","orcid":"https://orcid.org/0000-0002-8569-5694"},"institutions":[{"id":"https://openalex.org/I3197470489","display_name":"Alpha Omega Alpha Medical Honor Society","ror":"https://ror.org/057q9nn35","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I3197470489"]},{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthik Sankararaman","raw_affiliation_strings":["Meta AI, Menlo Park, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8569-5694","affiliations":[{"raw_affiliation_string":"Meta AI, Menlo Park, CA, USA","institution_ids":["https://openalex.org/I3197470489","https://openalex.org/I4210099336"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084108666","display_name":"Robert E. Schapire","orcid":"https://orcid.org/0000-0001-8616-1611"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Schapire","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8616-1611","affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058550942","display_name":"Aleksandrs Slivkins","orcid":"https://orcid.org/0000-0001-6899-6383"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aleksandrs Slivkins","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-6899-6383","affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.45,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.89108221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"69","issue":"6","first_page":"1","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6349196434020996},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6234357357025146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6091098189353943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.607720673084259},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5903106331825256},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4561454951763153},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4508301615715027},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4253506660461426},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4121336340904236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30239251255989075}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6349196434020996},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6234357357025146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6091098189353943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607720673084259},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5903106331825256},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4561454951763153},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4508301615715027},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4253506660461426},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4121336340904236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30239251255989075},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3557045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3557045","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":119,"referenced_works":["https://openalex.org/W165458731","https://openalex.org/W858396460","https://openalex.org/W1520045492","https://openalex.org/W1522825644","https://openalex.org/W1568307856","https://openalex.org/W1570963478","https://openalex.org/W1621376568","https://openalex.org/W1659045240","https://openalex.org/W1735261864","https://openalex.org/W1761637522","https://openalex.org/W1861297722","https://openalex.org/W1878322007","https://openalex.org/W1899379166","https://openalex.org/W1926592634","https://openalex.org/W1974144574","https://openalex.org/W1988790447","https://openalex.org/W2004001705","https://openalex.org/W2005951230","https://openalex.org/W2006618115","https://openalex.org/W2008737310","https://openalex.org/W2021185572","https://openalex.org/W2029241234","https://openalex.org/W2040924621","https://openalex.org/W2049337234","https://openalex.org/W2049934117","https://openalex.org/W2054033098","https://openalex.org/W2068490100","https://openalex.org/W2069121074","https://openalex.org/W2070546659","https://openalex.org/W2077902449","https://openalex.org/W2088844265","https://openalex.org/W2093825590","https://openalex.org/W2096355537","https://openalex.org/W2097477220","https://openalex.org/W2097487180","https://openalex.org/W2098258765","https://openalex.org/W2103715332","https://openalex.org/W2106887613","https://openalex.org/W2108746281","https://openalex.org/W2111957769","https://openalex.org/W2112788936","https://openalex.org/W2113184918","https://openalex.org/W2119840952","https://openalex.org/W2122422466","https://openalex.org/W2122886291","https://openalex.org/W2131951207","https://openalex.org/W2133156969","https://openalex.org/W2137716917","https://openalex.org/W2138637686","https://openalex.org/W2141514451","https://openalex.org/W2142115504","https://openalex.org/W2142339200","https://openalex.org/W2143343660","https://openalex.org/W2148352389","https://openalex.org/W2150865801","https://openalex.org/W2151056989","https://openalex.org/W2153441719","https://openalex.org/W2158268067","https://openalex.org/W2160374150","https://openalex.org/W2163322487","https://openalex.org/W2167603139","https://openalex.org/W2183531780","https://openalex.org/W2225232604","https://openalex.org/W2251049298","https://openalex.org/W2256838191","https://openalex.org/W2295428206","https://openalex.org/W2317700292","https://openalex.org/W2400128071","https://openalex.org/W2410251583","https://openalex.org/W2411868678","https://openalex.org/W2499002200","https://openalex.org/W2513180554","https://openalex.org/W2519411794","https://openalex.org/W2563363879","https://openalex.org/W2591610401","https://openalex.org/W2592542720","https://openalex.org/W2600756564","https://openalex.org/W2607074821","https://openalex.org/W2620217443","https://openalex.org/W2739805727","https://openalex.org/W2753339894","https://openalex.org/W2790607499","https://openalex.org/W2794925984","https://openalex.org/W2809682987","https://openalex.org/W2884013408","https://openalex.org/W2945871487","https://openalex.org/W2950929549","https://openalex.org/W2951445759","https://openalex.org/W2951825612","https://openalex.org/W2962697790","https://openalex.org/W2962751370","https://openalex.org/W2962775797","https://openalex.org/W2962838655","https://openalex.org/W2963100806","https://openalex.org/W2963635789","https://openalex.org/W2963695335","https://openalex.org/W2963831922","https://openalex.org/W2963921604","https://openalex.org/W2963981813","https://openalex.org/W2965276722","https://openalex.org/W2978329087","https://openalex.org/W2985924367","https://openalex.org/W3000524012","https://openalex.org/W3001086228","https://openalex.org/W3014623055","https://openalex.org/W3027079464","https://openalex.org/W3084669832","https://openalex.org/W3101463300","https://openalex.org/W3122984617","https://openalex.org/W3123586014","https://openalex.org/W4205841652","https://openalex.org/W4206275166","https://openalex.org/W4206478994","https://openalex.org/W4206530644","https://openalex.org/W4247154108","https://openalex.org/W4295847265","https://openalex.org/W4297795193","https://openalex.org/W6637533792","https://openalex.org/W6748377460"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2214256523","https://openalex.org/W3138989795","https://openalex.org/W3089449646","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":{"We":[0,136,183,213,255],"consider":[1],"Bandits":[2],"with":[3,140],"Knapsacks":[4],"(henceforth,":[5],"BwK":[6,41,73],"),":[7],"a":[8,19,25,37,44,94,164,173,185,205,226,253],"general":[9],"model":[10],"for":[11,188,218],"multi-armed":[12],"bandits":[13,240],"under":[14],"supply/budget":[15],"constraints.":[16],"In":[17],"particular,":[18],"bandit":[20,247],"algorithm":[21,139,187,217,233,248],"needs":[22],"to":[23,56,59,63,99,121,133,148,210,228,241,259],"solve":[24,229],"well-known":[26],"knapsack":[27],"problem":[28,42],":":[29,126],"find":[30],"an":[31,138,245],"optimal":[32],"packing":[33],"of":[34,47,129,180,197],"items":[35],"into":[36],"limited-size":[38],"knapsack.":[39],"The":[40,168],"is":[43,93,113,120,157,172,234],"common":[45],"generalization":[46],"numerous":[48],"motivating":[49],"examples,":[50],"which":[51,85,192],"range":[52],"from":[53,239],"dynamic":[54,60],"pricing":[55],"repeated":[57,201],"auctions":[58],"ad":[61],"allocation":[62],"network":[64],"routing":[65],"and":[66,104,203,222,249],"scheduling.":[67],"While":[68],"the":[69,76,81,86,101,105,118,123,127,130,149,158,177,181,189,195,219,230,235],"prior":[70,211],"work":[71],"on":[72,75,176,194],"focused":[74],"stochastic":[77,102,178,190],"version,":[78,191,221],"we":[79,161],"pioneer":[80],"other":[82],"extreme":[83],"in":[84,109,200],"outcomes":[87],"can":[88],"be":[89],"chosen":[90],"adversarially.":[91],"This":[92],"considerably":[95],"harder":[96],"problem,":[97],"compared":[98,209],"both":[100],"version":[103,179],"\u201cclassic\u201d":[106],"adversarial":[107,220],"bandits,":[108],"that":[110],"regret":[111,198],"minimization":[112,199],"no":[114],"longer":[115],"feasible.":[116],"Instead,":[117],"objective":[119],"minimize":[122],"competitive":[124,141],"ratio":[125,128,142],"benchmark":[131],"reward":[132],"algorithm\u2019s":[134],"reward.":[135],"design":[137],"O":[143],"(log":[144],"T":[145,156],")":[146],"relative":[147],"best":[150],"fixed":[151],"distribution":[152],"over":[153],"actions,":[154],"where":[155],"time":[159],"horizon;":[160],"also":[162],"prove":[163],"matching":[165],"lower":[166],"bound.":[167],"key":[169],"conceptual":[170],"contribution":[171],"new":[174,186],"perspective":[175],"problem.":[182],"suggest":[184],"builds":[193],"framework":[196],"games":[202],"admits":[204],"substantially":[206],"simpler":[207],"analysis":[208],"work.":[212],"then":[214],"analyze":[215],"this":[216,257],"use":[223,256],"it":[224,243,251],"as":[225,252],"subroutine":[227],"latter.":[231],"Our":[232],"first":[236],"\u201cblack-box":[237],"reduction\u201d":[238],"BwK:":[242],"takes":[244],"arbitrary":[246],"uses":[250],"subroutine.":[254],"reduction":[258],"derive":[260],"several":[261],"extensions.":[262]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}