{"id":"https://openalex.org/W7156780322","doi":"https://doi.org/10.48550/arxiv.2604.24120","title":"New Convex Programming Technique for Nash Social Welfare and Scheduling","display_name":"New Convex Programming Technique for Nash Social Welfare and Scheduling","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7156780322","doi":"https://doi.org/10.48550/arxiv.2604.24120"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24120","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24120","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2604.24120","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108923510","display_name":"Yuda Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Yuda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134788413","display_name":"Weijiang Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Weijiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134771737","display_name":"Shi Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Shi","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/T11031","display_name":"Game Theory and Applications","score":0.18799999356269836,"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/T11031","display_name":"Game Theory and Applications","score":0.18799999356269836,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.16519999504089355,"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"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.15960000455379486,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/ellipsoid-method","display_name":"Ellipsoid method","score":0.5759000182151794},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5407999753952026},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.5223000049591064},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5120000243186951},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4945000112056732},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4618000090122223},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.446399986743927},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.4050000011920929},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.3991999924182892}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5989999771118164},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.5759000182151794},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.5223000049591064},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5120000243186951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5023000240325928},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4945000112056732},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3991999924182892},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.3970000147819519},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.3880000114440918},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.3772999942302704},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.373199999332428},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.3580000102519989},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.351500004529953},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.3230000138282776},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.30140000581741333},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29409998655319214},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2872999906539917},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2572000026702881},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24120","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24120","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.24120","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24120","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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","score":0.48183053731918335,"display_name":"Reduced inequalities"}],"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],"propose":[1],"a":[2,17,44,105,116,123],"new":[3],"convex":[4,89,98,141],"programming":[5,142],"relaxation":[6],"for":[7,131],"the":[8,22,30,59,63,74,82,94,127,132,152],"weighted":[9],"Nash":[10],"social":[11],"welfare":[12],"(NSW)":[13],"problem":[14],"that":[15,87,108,139],"achieves":[16],"matching":[18],"$(e^{1/e}\\approx":[19],"1.445)$-approximation":[20],"via":[21],"rounding":[23],"algorithm":[24],"of":[25,48,56,100,126],"Feng":[26],"and":[27,102],"Li.":[28],"Unlike":[29],"exponential-size":[31],"configuration":[32],"LP":[33,71],"used":[34],"in":[35,58],"prior":[36],"work,":[37],"our":[38,88,119,140],"formulation":[39],"can":[40],"be":[41,66],"converted":[42],"into":[43],"compact":[45],"linear":[46],"program":[47,64,90,99],"polynomial":[49],"size,":[50],"incurring":[51],"only":[52],"an":[53],"additive":[54],"loss":[55],"$\\ln(1+\u03b5)$":[57],"objective.":[60],"This":[61],"allows":[62],"to":[65,93,145],"solved":[67],"directly":[68],"using":[69],"standard":[70],"solvers,":[72],"without":[73],"ellipsoid":[75],"method":[76],"or":[77],"dual":[78],"separation":[79],"oracles.":[80],"In":[81],"unweighted":[83],"case,":[84],"we":[85,137],"show":[86,138],"is":[91,112],"equivalent":[92],"restricted-spending":[95],"Fisher":[96],"market":[97],"Cole":[101],"Gkatzelis,":[103],"yielding":[104],"constructive":[106],"proof":[107,125],"its":[109],"integrality":[110],"gap":[111,130],"exactly":[113],"$e^{1/e}$.":[114],"With":[115],"minor":[117],"modification,":[118],"analysis":[120],"also":[121],"gives":[122],"simple":[124],"$e^{1/e}$":[128],"EF1":[129],"identical":[133],"agent":[134],"setting.":[135],"Finally,":[136],"technique":[143],"extends":[144],"two":[146],"unrelated":[147],"machine":[148],"scheduling":[149],"problems,":[150],"recovering":[151],"best-known":[153],"approximation":[154],"ratios":[155],"with":[156],"simpler":[157],"analyses.":[158]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-29T00:00:00"}