{"id":"https://openalex.org/W7160851348","doi":"https://doi.org/10.48550/arxiv.2605.06864","title":"Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization","display_name":"Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization","publication_year":2026,"publication_date":"2026-05-07","ids":{"openalex":"https://openalex.org/W7160851348","doi":"https://doi.org/10.48550/arxiv.2605.06864"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.06864","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06864","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2605.06864","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135907650","display_name":"John Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, John","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135844418","display_name":"Mengfan Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Mengfan","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.7479000091552734,"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.7479000091552734,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.04820000007748604,"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"}},{"id":"https://openalex.org/T10883","display_name":"Ethics and Social Impacts of AI","score":0.03579999879002571,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8540999889373779},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5454999804496765},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4512999951839447},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.4260999858379364},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4235000014305115},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.4113999903202057},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4059000015258789},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3937000036239624}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8540999889373779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5867000222206116},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5371000170707703},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4512999951839447},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.4260999858379364},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.4113999903202057},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4059000015258789},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C536738050","wikidata":"https://www.wikidata.org/wiki/Q3249071","display_name":"Social Welfare","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.2759000062942505},{"id":"https://openalex.org/C2778599509","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto efficiency","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26739999651908875},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.06864","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06864","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2605.06864","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06864","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5016278028488159}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,21,105],"study":[1],"multi-objective":[2],"multi-agent":[3],"multi-armed":[4],"bandits":[5],"(MO-MA-MAB)":[6],"under":[7],"stochastic":[8],"rewards,":[9],"where":[10],"agents":[11],"observe":[12],"heterogeneous":[13],"reward":[14,97],"vectors":[15],"and":[16,35,54,88,102,115,151,167,172],"communicate":[17],"over":[18,85],"time-varying":[19],"graphs.":[20],"formulate":[22,51,79],"this":[23],"emerging":[24],"problem":[25],"setting":[26],"to":[27,143],"address":[28],"\\emph{efficient":[29],"learning},":[30],"measured":[31],"by":[32,164],"Pareto":[33,52],"regret,":[34],"incorporate":[36],"\\emph{fair":[37],"learning}":[38],"as":[39],"an":[40,116,127],"additional":[41],"goal,":[42],"captured":[43],"via":[44],"social":[45],"welfare.":[46],"To":[47,73],"measure":[48],"efficiency,":[49],"we":[50,78],"regret":[53,114,129],"develop":[55],"\\textsc{Pareto":[56,108],"UCB1":[57,109],"Gossip},":[58,93],"whose":[59],"novel":[60],"exploration":[61],"radius":[62],"explicitly":[63],"separates":[64],"statistical":[65],"uncertainty":[66],"in":[67,169],"Pareto-based":[68],"inference":[69],"from":[70],"consensus":[71],"error.":[72],"express":[74],"the":[75,136,140,170],"fairness":[76,141,147,173],"constraint,":[77],"a":[80],"Nash":[81],"Social":[82],"Welfare":[83],"objective":[84],"preference-scalarized":[86],"rewards":[87],"propose":[89],"\\textsc{Simulated":[90,122],"NSW":[91,123],"UCB":[92,124],"which":[94],"integrates":[95],"preference-based":[96],"simulation,":[98],"gossip-based":[99],"utility":[100],"estimation,":[101],"UCB-style":[103],"exploration.":[104],"prove":[106],"that":[107,156],"Gossip}":[110,125],"achieves":[111,126],"\\(\\mathcal{O}(\\log":[112],"T)\\)":[113],"instance-independent":[117,128],"rate":[118],"of":[119,131,138],"\\(\\mathcal{O}(\\sqrt{T})\\),":[120],"while":[121],"bound":[130],"\\(\\mathcal{O}(T^{3/4})\\).":[132],"This":[133],"separation":[134],"reveals":[135],"cost":[137],"imposing":[139],"constraint":[142],"our":[144,157],"efficiency":[145,171],"objective:":[146],"limits":[148],"information":[149],"aggregation":[150],"slows":[152],"convergence.":[153],"Experiments":[154],"show":[155],"methods":[158],"consistently":[159],"outperform":[160],"baselines,":[161],"improving":[162],"performance":[163],"approximately":[165],"\\(100\\%\\)":[166],"\\(50\\%\\)":[168],"settings,":[174],"respectively.":[175]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-12T00:00:00"}