{"id":"https://openalex.org/W7151602128","doi":"https://doi.org/10.48550/arxiv.2604.04101","title":"Restless Bandits with Individual Penalty Constraints: Near-Optimal Indices and Deep Reinforcement Learning","display_name":"Restless Bandits with Individual Penalty Constraints: Near-Optimal Indices and Deep Reinforcement Learning","publication_year":2026,"publication_date":"2026-04-05","ids":{"openalex":"https://openalex.org/W7151602128","doi":"https://doi.org/10.48550/arxiv.2604.04101"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04101","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.2604.04101","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054757957","display_name":"Nida Zamir","orcid":"https://orcid.org/0000-0001-7631-7176"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zamir, Nida","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5060672325","display_name":"I-Hong Hou","orcid":"https://orcid.org/0000-0002-1166-8773"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hou, I-Hong","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.5781999826431274,"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.5781999826431274,"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.37950000166893005,"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/T11478","display_name":"Caching and Content Delivery","score":0.00570000009611249,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.7494000196456909},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6662999987602234},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6317999958992004},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4828000068664551},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.37630000710487366},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.3725999891757965},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.36959999799728394}],"concepts":[{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.7494000196456909},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6662999987602234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6452999711036682},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6317999958992004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5166000127792358},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4828000068664551},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.3725999891757965},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.31679999828338623},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C123197309","wikidata":"https://www.wikidata.org/wiki/Q2882343","display_name":"Multi-armed bandit","level":3,"score":0.28529998660087585},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04101","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.2604.04101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04101","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,112],"paper":[1],"investigates":[2],"the":[3,52,63,86,101,107,119,134,158,162,175],"Restless":[4],"Multi-Armed":[5],"Bandit":[6],"(RMAB)":[7],"framework":[8],"under":[9],"individual":[10,144],"penalty":[11,91,145],"constraints":[12],"to":[13,33,96,117,155],"address":[14],"resource":[15,65,110],"allocation":[16,66],"challenges":[17],"in":[18],"dynamic":[19],"wireless":[20],"networked":[21],"environments.":[22],"Unlike":[23],"conventional":[24],"RMAB":[25],"models,":[26],"our":[27],"model":[28],"allows":[29],"each":[30],"user":[31,82],"(arm)":[32],"have":[34],"distinct":[35],"and":[36,59,90,93,106,169],"stringent":[37],"performance":[38,183],"constraints,":[39,92],"such":[40,99],"as":[41,100],"energy":[42],"limits,":[43,45],"activation":[44],"or":[46],"age":[47],"of":[48,54,80,103,109],"information":[49],"minimums,":[50],"enabling":[51],"capture":[53],"diverse":[55],"objectives":[56],"including":[57],"fairness":[58],"efficiency.":[60],"To":[61],"find":[62],"optimal":[64,140],"policy,":[67],"we":[68,130],"propose":[69],"a":[70,150],"new":[71],"Penalty-Optimal":[72],"Whittle":[73],"(POW)":[74],"index":[75,79,136,160,177],"policy.":[76],"The":[77],"POW":[78,120,135,159,176],"an":[81],"only":[83,180],"depends":[84],"on":[85,161],"user's":[87],"transition":[88],"kernel":[89],"remains":[94],"invariable":[95],"system-wide":[97],"features":[98],"number":[102],"users":[104],"present":[105],"amount":[108],"available.":[111],"makes":[113],"it":[114],"computationally":[115],"tractable":[116],"calculate":[118],"indices":[121],"offline":[122],"without":[123],"any":[124],"need":[125],"for":[126],"online":[127],"adaptation.":[128],"Moreover,":[129],"theoretically":[131],"prove":[132],"that":[133,174],"policy":[137,178],"is":[138],"asymptotically":[139],"while":[141],"satisfying":[142],"all":[143],"constraints.":[146],"We":[147],"also":[148,185],"introduce":[149],"deep":[151],"reinforcement":[152],"learning":[153],"algorithm":[154],"efficiently":[156],"learn":[157],"fly.":[163],"Simulation":[164],"results":[165],"across":[166],"various":[167],"applications":[168],"system":[170],"configurations":[171],"further":[172],"demonstrate":[173],"not":[179],"has":[181],"near-optimal":[182],"but":[184],"significantly":[186],"outperforms":[187],"other":[188],"existing":[189],"policies.":[190]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-08T00:00:00"}