{"id":"https://openalex.org/W7127122051","doi":"https://doi.org/10.48550/arxiv.2601.22969","title":"Improved Algorithms for Nash Welfare in Linear Bandits","display_name":"Improved Algorithms for Nash Welfare in Linear Bandits","publication_year":2026,"publication_date":"2026-01-30","ids":{"openalex":"https://openalex.org/W7127122051","doi":"https://doi.org/10.48550/arxiv.2601.22969"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.22969","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124842669","display_name":"Dhruv Sarkar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarkar, Dhruv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026573611","display_name":"Nishant Pandey","orcid":"https://orcid.org/0000-0001-5632-6825"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pandey, Nishant","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052162709","display_name":"Sayak Ray Chowdhury","orcid":"https://orcid.org/0009-0000-6528-2457"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chowdhury, Sayak Ray","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.8601999878883362,"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.8601999878883362,"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/T10883","display_name":"Ethics and Social Impacts of AI","score":0.02879999950528145,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.022299999371170998,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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.9128999710083008},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7135999798774719},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.545199990272522},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5139999985694885},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.4966999888420105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44179999828338623},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4375}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9128999710083008},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7135999798774719},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.545199990272522},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5139999985694885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5022000074386597},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.4966999888420105},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.453000009059906},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44179999828338623},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4375},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43070000410079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4169999957084656},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.34860000014305115},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.2784000039100647},{"id":"https://openalex.org/C22349654","wikidata":"https://www.wikidata.org/wiki/Q2039354","display_name":"Risk dominance","level":5,"score":0.2529999911785126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.22969","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.22969","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.22969","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.22969","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.638584315776825,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Nash":[0,18,67,74,99],"regret":[1,68,82,141],"has":[2,25],"recently":[3],"emerged":[4],"as":[5,110],"a":[6,86,103,111],"principled":[7],"fairness-aware":[8],"performance":[9],"metric":[10],"for":[11,142],"stochastic":[12],"multi-armed":[13],"bandits,":[14,30,85],"motivated":[15],"by":[16,58],"the":[17,78,143,164],"Social":[19],"Welfare":[20],"objective.":[21],"Although":[22],"this":[23,51,55,122],"notion":[24],"been":[26],"extended":[27],"to":[28],"linear":[29,71,84,117,151],"existing":[31,165],"results":[32],"suffer":[33],"from":[34,41,155],"suboptimality":[35],"in":[36,70,83],"ambient":[37],"dimension":[38],"$d$,":[39],"stemming":[40],"proof":[42],"techniques":[43],"that":[44,63,89,108,136,159],"rely":[45],"on":[46,113,150],"restrictive":[47],"concentration":[48],"inequalities.":[49],"In":[50],"work,":[52],"we":[53,76],"resolve":[54],"open":[56],"problem":[57],"introducing":[59],"new":[60],"analytical":[61],"tools":[62],"yield":[64],"an":[65],"order-optimal":[66],"bound":[69],"bandits.":[72],"Beyond":[73],"regret,":[75],"initiate":[77],"study":[79],"of":[80,115,146],"$p$-means":[81,140],"unifying":[87],"framework":[88,123],"interpolates":[90],"between":[91],"fairness":[92],"and":[93,96,130,134],"utility":[94],"objectives":[95],"strictly":[97],"generalizes":[98],"regret.":[100],"We":[101,120],"propose":[102],"generic":[104],"algorithmic":[105],"framework,":[106],"FairLinBandit,":[107],"works":[109],"meta-algorithm":[112],"top":[114],"any":[116],"bandit":[118,126,152],"strategy.":[119],"instantiate":[121],"using":[124],"two":[125],"algorithms:":[127],"Phased":[128],"Elimination":[129],"Upper":[131],"Confidence":[132],"Bound,":[133],"prove":[135],"both":[137],"achieve":[138],"sublinear":[139],"entire":[144],"range":[145],"$p$.":[147],"Extensive":[148],"experiments":[149],"instances":[153],"generated":[154],"real-world":[156],"datasets":[157],"demonstrate":[158],"our":[160],"methods":[161],"consistently":[162],"outperform":[163],"state-of-the-art":[166],"baseline.":[167]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-03T00:00:00"}