{"id":"https://openalex.org/W7164029602","doi":"https://doi.org/10.1145/3798129.3800767","title":"The Complexity of Min-Max Optimization with Product Constraints","display_name":"The Complexity of Min-Max Optimization with Product Constraints","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164029602","doi":"https://doi.org/10.1145/3798129.3800767"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800767","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800767","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800767","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068192992","display_name":"Martino Bernasconi","orcid":"https://orcid.org/0000-0002-8594-2528"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Martino Bernasconi","raw_affiliation_strings":["Bocconi University, Milan, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8594-2528","affiliations":[{"raw_affiliation_string":"Bocconi University, Milan, Italy","institution_ids":["https://openalex.org/I71209653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018390908","display_name":"Matteo Castiglioni","orcid":"https://orcid.org/0000-0002-1070-6766"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Castiglioni","raw_affiliation_strings":["Politecnico di Milano, Milan, Italy"],"raw_orcid":"https://orcid.org/0000-0002-1070-6766","affiliations":[{"raw_affiliation_string":"Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"489","last_page":"499"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22059999406337738,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22059999406337738,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0940999984741211,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.06509999930858612,"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/product","display_name":"Product (mathematics)","score":0.45879998803138733},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.30730000138282776},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3034000098705292},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2939999997615814},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.2903999984264374},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.28700000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5479000210762024},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4027999937534332},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27639999985694885},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25540000200271606}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800767","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800767","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800767","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800767","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4538934826850891,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1594319238","https://openalex.org/W1980813953","https://openalex.org/W2017781790","https://openalex.org/W2044667552","https://openalex.org/W2057913812","https://openalex.org/W2169359757","https://openalex.org/W2531325587","https://openalex.org/W2811432292","https://openalex.org/W2963113737","https://openalex.org/W3132024219","https://openalex.org/W3166070555","https://openalex.org/W3168185438","https://openalex.org/W3171998715","https://openalex.org/W3206964102","https://openalex.org/W4306407822","https://openalex.org/W4313227201","https://openalex.org/W4399522794","https://openalex.org/W4415796558","https://openalex.org/W7128016483"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,22,39,56,70,75,87],"computational":[3],"complexity":[4,60],"of":[5,8,13,24,58],"problem":[7,32,76],"computing":[9],"local":[10],"min-max":[11],"equilibria":[12],"games":[14],"with":[15],"a":[16],"nonconvex-nonconcave":[17],"utility":[18],"function":[19],"f.":[20],"From":[21],"work":[23],"Daskalakis,":[25],"Skoulakis,":[26],"and":[27,72],"Zampetakis":[28],"(STOC":[29],"2021),":[30],"this":[31,66],"was":[33],"known":[34],"to":[35,47],"be":[36],"hard":[37],"in":[38,42,84],"restrictive":[40],"case":[41],"which":[43],"players":[44],"are":[45,51],"required":[46],"play":[48],"strategies":[49],"that":[50,74],"jointly":[52],"constrained,":[53],"leaving":[54],"open":[55],"question":[57,71],"its":[59],"under":[61,80],"more":[62],"natural":[63],"constraints.":[64],"In":[65],"paper,":[67],"we":[68],"settle":[69],"show":[73],"is":[77],"PPAD-hard":[78],"even":[79],"product":[81],"constraints":[82],"and,":[83],"particular,":[85],"over":[86],"hypercube.":[88]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-06-10T00:00:00"}