{"id":"https://openalex.org/W7125777322","doi":"https://doi.org/10.5555/3545946.3598780","title":"On regret-optimal cooperative nonstochastic multi-armed bandits","display_name":"On regret-optimal cooperative nonstochastic multi-armed bandits","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W7125777322","doi":"https://doi.org/10.5555/3545946.3598780"},"language":"en","primary_location":{"id":"pmh:oai:researchonline.lse.ac.uk:123623","is_oa":false,"landing_page_url":"https://orcid.org/0000-0003-1382-022X>","pdf_url":null,"source":{"id":"https://openalex.org/S7407055460","display_name":"LSE Research Online","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yi, Jialin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi, Jialin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Vojnovi\u0107, Milan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vojnovi\u0107, Milan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50602104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8662999868392944,"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":0.8662999868392944,"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/T11031","display_name":"Game Theory and Applications","score":0.04479999840259552,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.021199999377131462,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.9355000257492065},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8123999834060669},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6391000151634216},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5356000065803528},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.3450999855995178}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9355000257492065},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8123999834060669},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6391000151634216},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5356000065803528},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5134999752044678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5105999708175659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4422999918460846},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32580000162124634},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.24709999561309814}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:researchonline.lse.ac.uk:123623","is_oa":false,"landing_page_url":"https://orcid.org/0000-0003-1382-022X>","pdf_url":null,"source":{"id":"https://openalex.org/S7407055460","display_name":"LSE Research Online","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5269713401794434,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,17,28,76,99],"consider":[1],"the":[2,51,60,73,93,96],"nonstochastic":[3],"multi-agent":[4,39],"multi-armed":[5],"bandit":[6],"problem":[7],"with":[8,15,31,83,90,95],"agents":[9,71],"collaborating":[10],"via":[11],"a":[12,19,37,56,84],"communication":[13,35,74],"network":[14],"delays.":[16],"show":[18,29,78],"lower":[20,52],"bound":[21,48,53],"for":[22],"individual":[23,45],"regret":[24,46,88],"of":[25,62,70],"all":[26],"agents.":[27],"that":[30,49,79],"suitable":[32,85],"regularizers":[33],"and":[34,107],"protocols,":[36],"collaborative":[38],"follow-the-regularized-leader":[40],"(FTRL)":[41],"algorithm":[42,82],"has":[43],"an":[44,80],"upper":[47],"matches":[50],"up":[54],"to":[55,68,92],"constant":[57],"factor":[58],"when":[59,110],"number":[61],"arms":[63],"is":[64,87],"large":[65],"enough":[66],"relative":[67],"degrees":[69],"in":[72],"graph.":[75],"also":[77],"FTRL":[81],"regularizer":[86],"optimal":[89],"respect":[91],"scaling":[94],"edge-delay":[97],"parameter.":[98],"present":[100],"numerical":[101],"experiments":[102],"validating":[103],"our":[104,111],"theoretical":[105],"results":[106],"demonstrate":[108],"cases":[109],"algorithms":[112],"outperform":[113],"previously":[114],"proposed":[115],"algorithms.":[116]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}