{"id":"https://openalex.org/W7143316564","doi":"https://doi.org/10.48550/arxiv.2603.26647","title":"An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability","display_name":"An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7143316564","doi":"https://doi.org/10.48550/arxiv.2603.26647"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26647","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130991977","display_name":"Ashutosh Soni","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soni, Ashutosh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085838919","display_name":"Peizhong Ju","orcid":"https://orcid.org/0000-0002-4569-3539"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ju, Peizhong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eryilmaz, Atilla","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130913669","display_name":"Ness B. Shroff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shroff, Ness B.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8658999800682068,"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.8658999800682068,"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/T13553","display_name":"Age of Information Optimization","score":0.05829999968409538,"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/T11031","display_name":"Game Theory and Applications","score":0.008999999612569809,"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/heuristics","display_name":"Heuristics","score":0.6736000180244446},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6507999897003174},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.6306999921798706},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5514000058174133},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4772000014781952},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.45899999141693115},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4453999996185303},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4011000096797943},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.392300009727478}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6736000180244446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6571999788284302},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6507999897003174},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.6306999921798706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5874999761581421},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5514000058174133},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.45899999141693115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4453999996185303},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4011000096797943},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.392300009727478},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.3334999978542328},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C2988224531","wikidata":"https://www.wikidata.org/wiki/Q20830730","display_name":"Network structure","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"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,18,170],"study":[1],"the":[2,40,51,61,69,153,159,166,177,183,187,191,209,212],"stochastic":[3,66,135],"multi-armed":[4],"bandit":[5,140],"(MAB)":[6],"problem":[7],"where":[8,68,97],"an":[9,34,148],"underlying":[10],"network":[11,139,188],"structure":[12,189],"enables":[13],"side-observations":[14],"across":[15],"related":[16],"actions.":[17],"use":[19],"a":[20,27,120,125,172],"bipartite":[21],"graph":[22],"to":[23,26,110,130],"link":[24],"actions":[25,55,73],"set":[28,70],"of":[29,65,71,179,185],"unknowns,":[30],"such":[31,93],"that":[32,53,123,142,158,200,206],"selecting":[33],"action":[35],"reveals":[36],"observations":[37,161],"for":[38],"all":[39,54],"unknowns":[41],"it":[42],"is":[43],"connected":[44],"to.":[45],"While":[46],"previous":[47],"works":[48],"rely":[49],"on":[50,176],"assumption":[52],"are":[56,106,162],"permanently":[57],"accessible,":[58],"we":[59,117,195],"investigate":[60],"more":[62],"practical":[63],"setting":[64],"availability,":[67],"feasible":[72],"(the":[74],"\"activation":[75],"set\")":[76],"varies":[77],"dynamically":[78],"in":[79],"each":[80],"round.":[81],"This":[82],"framework":[83],"models":[84],"real-world":[85],"systems":[86],"with":[87],"both":[88,186],"structural":[89],"dependencies":[90],"and":[91,190],"volatility,":[92],"as":[94],"social":[95],"networks":[96],"users":[98],"provide":[99],"side-information":[100,210],"about":[101],"their":[102],"peers'":[103],"preferences,":[104],"yet":[105],"not":[107],"always":[108],"online":[109],"be":[111],"queried.":[112],"To":[113],"address":[114],"this":[115],"challenge,":[116],"propose":[118],"UCB-LP-A,":[119],"novel":[121],"policy":[122],"leverages":[124],"Linear":[126],"Programming":[127],"(LP)":[128],"approach":[129],"optimize":[131],"exploration-exploitation":[132],"trade-offs":[133],"under":[134],"availability.":[136],"Unlike":[137],"standard":[138],"algorithms":[141],"assume":[143],"constant":[144],"access,":[145],"UCB-LP-A":[146,201],"computes":[147],"optimal":[149],"sampling":[150],"distribution":[151],"over":[152],"realizable":[154],"activation":[155,192],"sets,":[156],"ensuring":[157],"necessary":[160],"gathered":[163],"using":[164],"only":[165],"currently":[167],"active":[168],"arms.":[169],"derive":[171],"theoretical":[173],"upper":[174],"bound":[175],"regret":[178],"our":[180],"policy,":[181],"characterizing":[182],"impact":[184],"probabilities.":[193],"Finally,":[194],"demonstrate":[196],"through":[197],"numerical":[198],"simulations":[199],"significantly":[202],"outperforms":[203],"existing":[204],"heuristics":[205],"ignore":[207],"either":[208],"or":[211],"availability":[213],"constraints.":[214]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-31T00:00:00"}