{"id":"https://openalex.org/W2591713661","doi":"https://doi.org/10.1145/3188745.3188968","title":"A converse to Banach's fixed point theorem and its CLS-completeness","display_name":"A converse to Banach's fixed point theorem and its CLS-completeness","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2591713661","doi":"https://doi.org/10.1145/3188745.3188968","mag":"2591713661"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188968","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188968","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188968","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT 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://dl.acm.org/doi/pdf/10.1145/3188745.3188968","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034822411","display_name":"Constantinos Daskalakis","orcid":"https://orcid.org/0000-0002-5451-0490"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Constantinos Daskalakis","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027430783","display_name":"Christos Tzamos","orcid":"https://orcid.org/0000-0002-7560-5069"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christos Tzamos","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083461583","display_name":"Manolis Zampetakis","orcid":"https://orcid.org/0009-0005-4967-5927"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manolis Zampetakis","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3144,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.97768763,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"44","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9689000248908997,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9689000248908997,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11777","display_name":"Fixed Point Theorems Analysis","score":0.92330002784729,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.660337507724762},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.6082107424736023},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.544259250164032},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.49817848205566406},{"id":"https://openalex.org/keywords/contraction-principle","display_name":"Contraction principle","score":0.4730120003223419},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4529106914997101},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.4099031984806061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4032471477985382},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28956806659698486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21467098593711853},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15684327483177185}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.660337507724762},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.6082107424736023},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.544259250164032},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.49817848205566406},{"id":"https://openalex.org/C2775958659","wikidata":"https://www.wikidata.org/wiki/Q5165690","display_name":"Contraction principle","level":3,"score":0.4730120003223419},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4529106914997101},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.4099031984806061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4032471477985382},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28956806659698486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21467098593711853},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15684327483177185},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3188745.3188968","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188968","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188968","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/137448.2","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137448.2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3188745.3188968","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188968","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188968","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3976577995","display_name":"EAGER: Testing Pseudorandom Distributions","funder_award_id":"1650733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7049971670","display_name":"EAGER: Research in the Interface of Algorithmic Game Theory and Learning","funder_award_id":"1551875","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8679789787","display_name":"AF: SMALL: Frontiers in Algorithmic Game Theory","funder_award_id":"1617730","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2591713661.pdf","grobid_xml":"https://content.openalex.org/works/W2591713661.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W750337621","https://openalex.org/W1568307856","https://openalex.org/W1991624978","https://openalex.org/W2002373723","https://openalex.org/W2023815950","https://openalex.org/W2051206974","https://openalex.org/W2057913812","https://openalex.org/W2065455958","https://openalex.org/W2103981148","https://openalex.org/W2124541940","https://openalex.org/W2145297839","https://openalex.org/W2151033164","https://openalex.org/W2169359757","https://openalex.org/W2186160814","https://openalex.org/W2296319761","https://openalex.org/W2345487362","https://openalex.org/W2403232853","https://openalex.org/W2430369560","https://openalex.org/W2474090883","https://openalex.org/W2536358984","https://openalex.org/W2571532866","https://openalex.org/W2577303423","https://openalex.org/W2594166360","https://openalex.org/W2594442970","https://openalex.org/W2770122339","https://openalex.org/W2963972677","https://openalex.org/W3141595720","https://openalex.org/W3154016153","https://openalex.org/W3160805239"],"related_works":["https://openalex.org/W2846516035","https://openalex.org/W4249977926","https://openalex.org/W2585118952","https://openalex.org/W2012141574","https://openalex.org/W1606221119","https://openalex.org/W2354765335","https://openalex.org/W3123504591","https://openalex.org/W2369544116","https://openalex.org/W1691643469","https://openalex.org/W2985828462"],"abstract_inverted_index":{"Banach's":[0,46,56,82],"fixed":[1,57,101,124],"point":[2,58],"theorem":[3,47,59],"for":[4,92,104],"contraction":[5,170],"maps":[6,29],"has":[7],"been":[8],"widely":[9,156],"used":[10,141,157],"to":[11,31,60,99,121,142],"analyze":[12],"the":[13,36,43,62,132,144,155],"convergence":[14,63,95,107,167],"of":[15,45,64,81,96,146,164],"iterative":[16,28,65,97,117,133],"methods":[17,66,98],"in":[18,39,154],"non-convex":[19],"problems.":[20],"It":[21],"is":[22,77,87,135],"a":[23,78,88,122,128,161],"common":[24],"experience,":[25],"however,":[26],"that":[27,85],"fail":[30],"be":[32,140],"globally":[33,119],"contracting":[34,136],"under":[35,130],"natural":[37],"metric":[38,129],"their":[40,106],"domain,":[41],"making":[42],"applicability":[44],"limited.":[48],"We":[49,150],"explore":[50],"how":[51],"generally":[52],"we":[53,112],"can":[54,139],"apply":[55],"establish":[61],"when":[67],"pairing":[68],"it":[69,86],"with":[70],"carefully":[71],"designed":[72],"metrics.":[73],"Our":[74],"first":[75],"result":[76],"strong":[79],"converse":[80],"theorem,":[83],"showing":[84],"universal":[89],"analysis":[90],"tool":[91],"establishing":[93],"global":[94],"unique":[100,123],"points,":[102],"and":[103,137],"bounding":[105,165],"rate.":[108],"In":[109],"other":[110],"words,":[111],"show":[113],"that,":[114],"whenever":[115],"an":[116],"map":[118,134],"converges":[120],"point,":[125],"there":[126],"exists":[127],"which":[131,138],"bound":[143],"number":[145],"iterations":[147],"until":[148],"convergence.":[149],"illustrate":[151],"our":[152],"approach":[153],"power":[158],"method,":[159],"providing":[160],"new":[162],"way":[163],"its":[166],"rate":[168],"through":[169],"arguments.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}