{"id":"https://openalex.org/W7128696720","doi":"https://doi.org/10.48550/arxiv.2602.10469","title":"Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples","display_name":"Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128696720","doi":"https://doi.org/10.48550/arxiv.2602.10469"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.10469","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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/A5101322866","display_name":"Zongjun Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yang, Zongjun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081625048","display_name":"Rachitesh Kumar","orcid":"https://orcid.org/0000-0001-7803-6861"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kumar, Rachitesh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083207349","display_name":"Christian Kroer","orcid":"https://orcid.org/0000-0002-9009-8683"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kroer, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101322866"],"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.6496000289916992,"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.6496000289916992,"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.1251000016927719,"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/T11031","display_name":"Game Theory and Applications","score":0.07090000063180923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8909000158309937},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.4724999964237213},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.45730000734329224},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4560000002384186},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.36899998784065247},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.3684999942779541},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.33869999647140503}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8909000158309937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47440001368522644},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4560000002384186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4551999866962433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3847000002861023},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3684999942779541},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.33869999647140503},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.30550000071525574},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.10469","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.10469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10469","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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.10469","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6612457633018494,"display_name":"Peace, Justice and strong institutions"}],"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,35,86,122],"study":[1],"online":[2,84,115],"fair":[3],"allocation":[4,56],"of":[5,19,27,104,147,198,206],"$T$":[6],"sequentially":[7],"arriving":[8],"items":[9,163],"among":[10],"$n$":[11],"agents":[12],"with":[13,16,31,97],"heterogeneous":[14],"preferences,":[15],"the":[17,25,38,45,53,77,83,102,108,137,145,155,161,166,175,181,196,204],"objective":[18],"maximizing":[20],"generalized-mean":[21],"welfare,":[22],"defined":[23],"as":[24],"$p$-mean":[26],"agents'":[28],"time-averaged":[29],"utilities,":[30],"$p\\in":[32],"(-\\infty,":[33],"1)$.":[34],"first":[36],"consider":[37],"i.i.d.":[39,90],"arrival":[40],"model":[41,96],"and":[42,75,92,173,201],"show":[43,123,202],"that":[44,113,124,160,193,203],"pure":[46],"greedy":[47],"algorithm":[48,69,116],"--":[49,57],"which":[50],"myopically":[51],"chooses":[52],"welfare-maximizing":[54],"integral":[55],"achieves":[58,76],"$\\widetilde{O}(1/T)$":[59,139],"average":[60,120,140],"regret.":[61,121],"Importantly,":[62],"in":[63,144,170,183],"contrast":[64],"to":[65,135,179,212],"prior":[66],"work,":[67],"our":[68,207],"does":[70],"not":[71],"require":[72],"distributional":[73],"knowledge":[74],"optimal":[78,138],"regret":[79,141],"rate":[80],"using":[81],"only":[82,125],"samples.":[85],"then":[87],"go":[88],"beyond":[89],"arrivals":[91],"investigate":[93],"a":[94,126],"nonstationary":[95],"time-varying":[98],"independent":[99],"distributions.":[100],"In":[101],"absence":[103],"additional":[105],"data":[106],"about":[107],"distributions,":[109],"it":[110],"is":[111,133,210],"known":[112],"every":[114,184],"must":[117],"suffer":[118],"$\u03a9(1)$":[119],"single":[127],"historical":[128,199],"sample":[129],"from":[130],"each":[131],"distribution":[132,191],"sufficient":[134],"recover":[136],"rate,":[142],"even":[143],"face":[146],"arbitrary":[148],"non-stationarity.":[149],"Our":[150],"algorithms":[151,209],"are":[152],"based":[153],"on":[154],"re-solving":[156,208],"paradigm:":[157],"they":[158],"assume":[159],"remaining":[162],"will":[164],"be":[165],"ones":[167],"seen":[168],"historically":[169],"those":[171],"periods":[172],"solve":[174],"resulting":[176],"welfare-maximization":[177],"problem":[178],"determine":[180],"decision":[182],"period.":[185],"Finally,":[186],"we":[187],"also":[188],"account":[189],"for":[190],"shifts":[192],"may":[194],"distort":[195],"fidelity":[197],"samples":[200],"performance":[205],"robust":[211],"such":[213],"shifts.":[214]},"counts_by_year":[],"updated_date":"2026-05-04T08:30:34.212998","created_date":"2026-02-13T00:00:00"}