{"id":"https://openalex.org/W2963945346","doi":"https://doi.org/10.1109/infocom.2019.8737461","title":"Combinatorial Sleeping Bandits with Fairness Constraints","display_name":"Combinatorial Sleeping Bandits with Fairness Constraints","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2963945346","doi":"https://doi.org/10.1109/infocom.2019.8737461","mag":"2963945346"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-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/A5101467960","display_name":"Fengjiao Li","orcid":"https://orcid.org/0000-0002-0564-1347"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fengjiao Li","raw_affiliation_strings":["Department of Computer Science, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100409661","display_name":"Jia Liu","orcid":"https://orcid.org/0000-0001-8844-3233"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jia Liu","raw_affiliation_strings":["Department of Computer Science, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040279482","display_name":"Bo Ji","orcid":"https://orcid.org/0000-0003-0149-7509"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Ji","raw_affiliation_strings":["Department of Computer Science, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101467960"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":12.2796,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.9882224,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1702","last_page":"1710"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9925000071525574,"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.9911999702453613,"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/computer-science","display_name":"Computer science","score":0.6158843040466309},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34142810106277466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16872045397758484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6158843040466309},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34142810106277466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16872045397758484}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W35251828","https://openalex.org/W1965106111","https://openalex.org/W2008098735","https://openalex.org/W2009551863","https://openalex.org/W2049934117","https://openalex.org/W2087294514","https://openalex.org/W2093562354","https://openalex.org/W2108746281","https://openalex.org/W2121136483","https://openalex.org/W2122011919","https://openalex.org/W2125724988","https://openalex.org/W2137152139","https://openalex.org/W2145417574","https://openalex.org/W2167264214","https://openalex.org/W2168405694","https://openalex.org/W2217850561","https://openalex.org/W2317700292","https://openalex.org/W2396394641","https://openalex.org/W2499002200","https://openalex.org/W2542446008","https://openalex.org/W2734285318","https://openalex.org/W2774113864","https://openalex.org/W2790016504","https://openalex.org/W2790607499","https://openalex.org/W2799539834","https://openalex.org/W2808206048","https://openalex.org/W2841576068","https://openalex.org/W2962771056","https://openalex.org/W2963860006","https://openalex.org/W2963945346","https://openalex.org/W2964041372","https://openalex.org/W2964326108","https://openalex.org/W3027079464","https://openalex.org/W3103451209","https://openalex.org/W4295722032","https://openalex.org/W6601392155","https://openalex.org/W6637659893","https://openalex.org/W6678160143","https://openalex.org/W6684381734","https://openalex.org/W6712331629","https://openalex.org/W6729106829","https://openalex.org/W6741129288","https://openalex.org/W6746728249"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"The":[0,25,117],"multi-armed":[1],"bandit":[2],"(MAB)":[3],"model":[4,50,103],"has":[5,211],"been":[6],"widely":[7],"adopted":[8],"for":[9,135,194],"studying":[10],"many":[11,59],"practical":[12],"optimization":[13],"problems":[14],"(network":[15],"resource":[16],"allocation,":[17],"ad":[18],"placement,":[19],"crowdsourcing,":[20],"etc.)":[21],"with":[22,104,157,190],"unknown":[23],"parameters.":[24],"goal":[26],"of":[27,44,55,130,239,246,288,306],"the":[28,31,38,42,47,56,112,123,127,167,174,195,235,243,255,286,289,293,301,304,312],"player":[29],"(i.e.,":[30,65,78],"decision":[32],"maker)":[33],"here":[34],"is":[35,85,119,206,234,242,254,271],"to":[36,110,121,155,171,284,308],"maximize":[37,122],"cumulative":[39],"reward":[40,81,124],"in":[41,58,91],"face":[43],"uncertainty.":[45],"However,":[46],"basic":[48],"MAB":[49,102],"neglects":[51],"several":[52],"important":[53,298],"factors":[54],"system":[57],"realworld":[60],"applications,":[61],"where":[62,232],"multiple":[63],"arms":[64,247],"actions)":[66],"can":[67,249,277],"be":[68,76,250],"simultaneously":[69,251],"played":[70],"and":[71,163,165,262,269,303],"an":[72,146,297],"arm":[73],"could":[74],"sometimes":[75],"\u201csleeping\u201d":[77],"unavailable).":[79],"Besides":[80],"maximization,":[82],"ensuring":[83],"fairness":[84,128,175,313],"also":[86,210],"a":[87,98,131,158,185,212,272,309],"key":[88],"design":[89,273],"concern":[90],"practice.":[92],"To":[93,139],"that":[94,202,248,275],"end,":[95],"we":[96,144,183,199,276,280],"propose":[97],"new":[99,142,186],"Combinatorial":[100],"Sleeping":[101],"Fairness":[105,191],"constraints,":[106],"called":[107,150,188],"CSMAB-F,":[108],"aiming":[109],"address":[111],"aforementioned":[113],"crucial":[114],"modeling":[115],"issues.":[116],"objective":[118],"now":[120],"while":[125],"satisfying":[126,311],"requirement":[129],"minimum":[132],"selection":[133],"fraction":[134],"each":[136],"individual":[137],"arm.":[138],"tackle":[140],"this":[141],"problem,":[143],"extend":[145],"online":[147],"learning":[148],"algorithm,":[149,187],"Upper":[151],"Confidence":[152],"Bound":[153],"(UCB),":[154],"deal":[156],"critical":[159],"tradeoff":[160,299],"between":[161,300],"exploitation":[162],"exploration":[164],"employ":[166],"virtual":[168],"queue":[169],"technique":[170],"properly":[172],"handle":[173],"constraints.":[176,314],"By":[177],"carefully":[178],"integrating":[179],"these":[180],"two":[181],"techniques,":[182],"develop":[184],"Learning":[189],"Guarantee":[192],"(LFG),":[193],"CSMAB-F":[196],"problem.":[197],"Further,":[198],"rigorously":[200],"prove":[201],"not":[203],"only":[204],"LFG":[205],"feasibility-optimal,":[207],"but":[208],"it":[209],"time-average":[213],"regret":[214,302],"upper":[215],"bounded":[216],"by":[217],"N/2\u03b7":[218],"+":[219],"\u03b2":[220,258,263],"<sub":[221,228,259,264],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[222,229,260,265],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[223,261],"\u221amNT":[224],"log":[225],"T":[226,237,253],"+\u03b2":[227],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[230,266],"N/T,":[231],"N":[233],"total":[236],"number":[238,245],"arms,":[240],"m":[241],"maximum":[244],"played,":[252],"time":[256],"horizon,":[257],"are":[267],"constants,":[268],"\u03b7":[270],"parameter":[274],"tune.":[278],"Finally,":[279],"perform":[281],"extensive":[282],"simulations":[283],"corroborate":[285],"effectiveness":[287],"proposed":[290],"algorithm.":[291],"Interestingly,":[292],"simulation":[294],"results":[295],"reveal":[296],"speed":[305],"convergence":[307],"point":[310]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}