{"id":"https://openalex.org/W7128622669","doi":"https://doi.org/10.1109/focs63196.2025.00125","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","display_name":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128622669","doi":"https://doi.org/10.1109/focs63196.2025.00125"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034190038","display_name":"Ishani Karmarkar","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ishani Karmarkar","raw_affiliation_strings":["Stanford University Stanford,United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford,United States","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007800173","display_name":"Liam O\u2019Carroll","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liam O\u2019Carroll","raw_affiliation_strings":["Stanford University Stanford,United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford,United States","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125655878","display_name":"Aaron Sidford","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":["Stanford University Stanford,United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford,United States","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.5254,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.92160873,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2381","last_page":"2391"},"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.4675999879837036,"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.4675999879837036,"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/T11031","display_name":"Game Theory and Applications","score":0.2070000022649765,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.054099999368190765,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/oracle","display_name":"Oracle","score":0.6115999817848206},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5738999843597412},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.46869999170303345},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45579999685287476},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.40689998865127563},{"id":"https://openalex.org/keywords/transpose","display_name":"Transpose","score":0.40049999952316284},{"id":"https://openalex.org/keywords/normal-form-game","display_name":"Normal-form game","score":0.38510000705718994},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3815999925136566}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5738999843597412},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5041000247001648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4986000061035156},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41990000009536743},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C200106649","wikidata":"https://www.wikidata.org/wiki/Q223683","display_name":"Transpose","level":3,"score":0.40049999952316284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.397599995136261},{"id":"https://openalex.org/C155930848","wikidata":"https://www.wikidata.org/wiki/Q1069099","display_name":"Normal-form game","level":4,"score":0.38510000705718994},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3400999903678894},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33000001311302185},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.2948000133037567},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.28130000829696655},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00125","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307764","display_name":"Microsoft","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,85],"paper":[2,121,128],"we":[3],"consider":[4],"the":[5,49,70],"problem":[6,50],"of":[7,13,74,102],"computing":[8,108],"an":[9,123],"$\\epsilon$-approximate":[10],"Nash":[11],"Equilibrium":[12],"a":[14,18,32,44,88,99,109],"zerosum":[15],"game":[16],"in":[17,61],"payoff":[19],"matrix":[20],"$A":[21],"\\in":[22],"\\mathbb{R}^{m":[23],"\\times":[24],"n}$":[25],"with":[26],"$O(1)$-bounded":[27],"entries":[28],"given":[29],"access":[30],"to":[31],"matrix-vector":[33],"product":[34],"oracle":[35],"for":[36,97],"A":[37],"and":[38,64,80],"its":[39],"transpose":[40],"$A^{\\top}$.":[41],"We":[42,83],"provide":[43],"deterministic":[45,94],"algorithm":[46],"that":[47,91],"solves":[48],"using":[51],"$\\tilde{O}\\left(\\epsilon^{-8":[52],"/":[53],"9}\\right)$-oracle":[54],"queries,":[55],"where":[56],"$\\tilde{O}(\\cdot)$":[57],"hides":[58],"factors":[59],"polylogarithmic":[60],"m,":[62],"n,":[63],"$\\epsilon^{-1}$.":[65],"Our":[66],"result":[67,86],"improves":[68],"upon":[69],"state-of-the-art":[71],"query":[72,95],"complexity":[73],"$\\tilde{O}\\left(\\epsilon^{-1}\\right)$":[75],"established":[76],"by":[77],"[Nemirovski,":[78],"2004]":[79],"[Nesterov,":[81],"2005].":[82],"obtain":[84],"through":[87],"general":[89],"framework":[90],"yields":[92],"improved":[93],"complexities":[96],"solving":[98],"broader":[100],"class":[101],"minimax":[103],"optimization":[104],"problems":[105],"which":[106],"includes":[107],"linear":[110,119],"classifier":[111],"(hard-margin":[112],"support":[113],"vector":[114],"machine)":[115],"as":[116,118],"well":[117],"regression.11This":[120],"is":[122],"extended":[124],"abstract.":[125],"The":[126],"full":[127],"can":[129],"be":[130],"accessed":[131],"at":[132],"https://arxiv.org/abs/2509.04426.":[133]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-12T00:00:00"}