{"id":"https://openalex.org/W7166881563","doi":"https://doi.org/10.4230/lipics.icalp.2026.90","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-01-01","ids":{"openalex":"https://openalex.org/W7166881563","doi":"https://doi.org/10.4230/lipics.icalp.2026.90"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26479","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.90","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.90/LIPIcs.ICALP.2026.90.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.90/LIPIcs.ICALP.2026.90.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108923510","display_name":"Yuda Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]},{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng, Yuda","raw_affiliation_strings":["School of Computer Science, Nanjing University, China"],"raw_orcid":"https://orcid.org/0009-0004-7461-2285","affiliations":[{"raw_affiliation_string":"School of Computer Science, Nanjing University, China","institution_ids":["https://openalex.org/I200845125","https://openalex.org/I36399199","https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139801635","display_name":"Weijiang Hu","orcid":"https://orcid.org/0009-0002-7585-2497"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]},{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hu, Weijiang","raw_affiliation_strings":["School of Computer Science, Nanjing University, China"],"raw_orcid":"https://orcid.org/0009-0002-7585-2497","affiliations":[{"raw_affiliation_string":"School of Computer Science, Nanjing University, China","institution_ids":["https://openalex.org/I200845125","https://openalex.org/I36399199","https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100430766","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9140-9415"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]},{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Shi","raw_affiliation_strings":["School of Computer Science, Nanjing University, China"],"raw_orcid":"https://orcid.org/0000-0001-9140-9415","affiliations":[{"raw_affiliation_string":"School of Computer Science, Nanjing University, China","institution_ids":["https://openalex.org/I200845125","https://openalex.org/I36399199","https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75283556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10991","display_name":"Game Theory and Voting Systems","score":0.22460000216960907,"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"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.22460000216960907,"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/T11031","display_name":"Game Theory and Applications","score":0.1873999983072281,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.09610000252723694,"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":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26479","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.90","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.90/LIPIcs.ICALP.2026.90.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.90","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.90","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26479","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.90","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.90/LIPIcs.ICALP.2026.90.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"sustainable_development_goals":[{"score":0.5481852889060974,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166881563.pdf","grobid_xml":"https://content.openalex.org/works/W7166881563.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,17,45,106,117,124],"new":[3],"convex":[4,90,99,142],"programming":[5,143],"relaxation":[6],"for":[7,132],"the":[8,23,31,60,64,75,83,95,128,133,153],"weighted":[9],"Nash":[10],"social":[11],"welfare":[12],"(NSW)":[13],"problem":[14],"that":[15,88,109,140],"achieves":[16],"matching":[18],"(e^{1/e}":[19],"\u2248":[20],"1.445)-approximation":[21],"via":[22],"rounding":[24],"algorithm":[25],"of":[26,49,57,101,127],"Feng":[27],"and":[28,103],"Li.":[29],"Unlike":[30],"exponential-size":[32],"configuration":[33],"LP":[34,72],"used":[35],"in":[36,59],"prior":[37],"work,":[38],"our":[39,89,120,141],"formulation":[40],"can":[41],"be":[42,67],"converted":[43],"into":[44],"compact":[46],"linear":[47],"program":[48,65,91,100],"polynomial":[50],"size,":[51],"incurring":[52],"only":[53],"an":[54],"additive":[55],"loss":[56],"ln(1+\u03b5)":[58],"objective.":[61],"This":[62],"allows":[63],"to":[66,94,146],"solved":[68],"directly":[69],"using":[70],"standard":[71],"solvers,":[73],"without":[74],"ellipsoid":[76],"method":[77],"or":[78],"dual":[79],"separation":[80],"oracles.":[81],"In":[82],"unweighted":[84],"case,":[85],"we":[86,138],"show":[87,139],"is":[92,113],"equivalent":[93],"restricted-spending":[96],"Fisher":[97],"market":[98],"Cole":[102],"Gkatzelis,":[104],"yielding":[105],"constructive":[107],"proof":[108,126],"its":[110],"integrality":[111],"gap":[112,131],"exactly":[114],"e^{1/e}.":[115],"With":[116],"minor":[118],"modification,":[119],"analysis":[121],"also":[122],"gives":[123],"simple":[125],"e^{1/e}":[129],"EF1":[130],"identical":[134],"agent":[135],"setting.":[136],"Finally,":[137],"technique":[144],"extends":[145],"two":[147],"unrelated":[148],"machine":[149],"scheduling":[150],"problems,":[151],"recovering":[152],"best-known":[154],"approximation":[155],"ratios":[156],"with":[157],"simpler":[158],"analyses.":[159]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-07-02T00:00:00"}