{"id":"https://openalex.org/W7084073400","doi":"https://doi.org/10.1109/infocom55648.2025.11044728","title":"On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit","display_name":"On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W7084073400","doi":"https://doi.org/10.1109/infocom55648.2025.11044728"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - 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":null,"display_name":"Xiaoyi Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiaoyi Wu","raw_affiliation_strings":["Pennsylvania State University, University Park,Department of Electrical Engineering,PA,USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park,Department of Electrical Engineering,PA,USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Bo Ji","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Ji","raw_affiliation_strings":["Virginia Tech,Department of Computer Science,Blacksburg,Virginia,USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech,Department of Computer Science,Blacksburg,Virginia,USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":null,"display_name":"Bin Li","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Li","raw_affiliation_strings":["Pennsylvania State University, University Park,Department of Electrical Engineering,PA,USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park,Department of Electrical Engineering,PA,USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":2.3417,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.92556267,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11864","display_name":"Supply Chain Resilience and Risk Management","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11864","display_name":"Supply Chain Resilience and Risk Management","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11711","display_name":"COVID-19 Pandemic Impacts","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8259000182151794},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5038999915122986},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45660001039505005},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45579999685287476},{"id":"https://openalex.org/keywords/online-learning","display_name":"Online learning","score":0.4278999865055084},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.39160001277923584},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.31470000743865967}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8259000182151794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6152999997138977},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4690999984741211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4586000144481659},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3276999890804291},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.31470000743865967},{"id":"https://openalex.org/C149810388","wikidata":"https://www.wikidata.org/wiki/Q5374873","display_name":"Emulation","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C123197309","wikidata":"https://www.wikidata.org/wiki/Q2882343","display_name":"Multi-armed bandit","level":3,"score":0.28679999709129333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2856999933719635},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.486444890499115,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"Multi-Armed":[1],"Bandit":[2],"with":[3,67,103,118],"fairness":[4,49,200],"constraints":[5,94],"is":[6],"a":[7,13,57,64,139,168,183],"framework":[8],"where":[9],"multiple":[10],"arms":[11,76,84,99,113,159],"form":[12],"super":[14,65,75,98,112,158],"arm":[15,61,66],"and":[16,51,62,201],"can":[17,100,123,179],"be":[18,78,180],"pulled":[19],"in":[20,80,85,129,175],"each":[21,37,60],"round":[22],"under":[23],"uncertainty":[24],"to":[25,92,114,160,167,182],"maximize":[26],"cumulative":[27],"rewards":[28],"while":[29],"ensuring":[30],"the":[31,48,68,81,95,104,110,116,119,130,146,170,176,188],"minimum":[32],"average":[33],"reward":[34],"required":[35],"by":[36],"arm.":[38],"The":[39,72,191],"existing":[40],"pessimistic-optimistic":[41,131,177],"algorithm":[42,143,178],"linearly":[43],"combines":[44],"virtual":[45],"queue-lengths":[46],"(tracking":[47],"violations)":[50],"Upper":[52],"Confidence":[53],"Bound":[54],"estimates":[55],"as":[56],"weight":[58,122],"for":[59],"selects":[63],"maximum":[69,120],"total":[70,121],"weight.":[71],"number":[73,82,96,105,171],"of":[74,83,97,106,172],"could":[77],"exponential":[79],"many":[86],"scenarios.":[87],"In":[88],"wireless":[89],"networks,":[90],"due":[91],"interference":[93],"grow":[101],"exponentially":[102],"arms.":[107],"Evaluating":[108],"all":[109],"feasible":[111,157],"find":[115],"one":[117],"incur":[124],"extremely":[125],"high":[126],"computational":[127,189],"complexity":[128],"algorithm.":[132],"To":[133],"tackle":[134],"this":[135],"issue,":[136],"we":[137,207],"develop":[138],"low-complexity":[140,197],"fair":[141],"learning":[142],"based":[144],"on":[145],"so-called":[147],"pick-and-compare":[148],"approach":[149],"that":[150,195],"involves":[151],"randomly":[152],"picking":[153],"<tex":[154,164],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[155,165],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[156,166],"evaluate.":[161],"By":[162],"setting":[163],"constant,":[169,184],"comparison":[173],"steps":[174],"reduced":[181],"thereby":[185],"significantly":[186],"reducing":[187],"complexity.":[190],"theoretical":[192,210],"analysis":[193],"shows":[194],"our":[196,209],"design":[198],"sacrifices":[199],"regret":[202],"performance":[203],"only":[204],"marginally.":[205],"Finally,":[206],"validate":[208],"results":[211],"through":[212],"extensive":[213],"simulations.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}