{"id":"https://openalex.org/W2139192858","doi":null,"title":"First-order algorithm with O(ln(1/\u03b5 )) convergence for \u03b5 -equilibrium in two-person zero-sum games","display_name":"First-order algorithm with O(ln(1/\u03b5 )) convergence for \u03b5 -equilibrium in two-person zero-sum games","publication_year":2008,"publication_date":"2008-07-13","ids":{"openalex":"https://openalex.org/W2139192858","mag":"2139192858"},"language":"en","primary_location":{"id":"mag:2139192858","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2008/AAAI08-012.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Andrew R. Gilpin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew R. Gilpin","raw_affiliation_strings":["Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pa","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016340912","display_name":"Javier Pe\u00f1a","orcid":"https://orcid.org/0000-0001-5698-1918","observed_orcids":["https://orcid.org/0000-0001-5698-1918"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javier Pe\u00f1a","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh PA, "],"raw_orcid":"https://orcid.org/0000-0001-5698-1918","affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh PA, ","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Thomas Sandholm","orcid":"https://orcid.org/0000-0003-0554-3584","observed_orcids":["https://orcid.org/0000-0003-0554-3584"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Sandholm","raw_affiliation_strings":["Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pa"],"raw_orcid":"https://orcid.org/0000-0003-0554-3584","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pa","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":6.0323,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96735075,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"75","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.926800012588501,"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.926800012588501,"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.017000000923871994,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.011500000022351742,"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/two-player-zero-sum-games","display_name":"two-person zero-sum games","score":0.8669999837875366},{"id":"https://openalex.org/keywords/nash-equilibrium-computation","display_name":"Nash equilibrium computation","score":0.7350000143051147},{"id":"https://openalex.org/keywords/nesterov-smoothing","display_name":"Nesterov smoothing","score":0.8100000023841858},{"id":"https://openalex.org/keywords/iteration-complexity","display_name":"iteration complexity","score":0.6510000228881836},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"epsilon-equilibrium","score":0.8519999980926514},{"id":"https://openalex.org/keywords/matrix-games","display_name":"matrix games","score":0.8730000257492065},{"id":"https://openalex.org/keywords/sequential-games","display_name":"sequential games","score":0.9940000176429749},{"id":"https://openalex.org/keywords/min-max-optimization","display_name":"minimax optimization","score":0.5239999890327454},{"id":"https://openalex.org/keywords/large-scale-games","display_name":"large-scale games","score":0.4580000042915344}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6810242533683777},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.632882833480835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5994681715965271},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5734675526618958},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.542016863822937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5385542511940002},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4831518530845642},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4770040810108185},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4751841127872467},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.45342421531677246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44252851605415344},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.43518900871276855},{"id":"https://openalex.org/C136356330","wikidata":"https://www.wikidata.org/wiki/Q156612","display_name":"Zero-sum game","level":3,"score":0.43304675817489624},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42781898379325867},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.42613688111305237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.387840211391449},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33452531695365906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1919475793838501},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.1642235517501831},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2139192858","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2008/AAAI08-012.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1503425191","https://openalex.org/W1510190958","https://openalex.org/W1518039036","https://openalex.org/W1520830672","https://openalex.org/W1528107507","https://openalex.org/W1564540124","https://openalex.org/W1980392196","https://openalex.org/W2000955051","https://openalex.org/W2008164266","https://openalex.org/W2022004439","https://openalex.org/W2023373582","https://openalex.org/W2042860556","https://openalex.org/W2103315867","https://openalex.org/W2104784127","https://openalex.org/W2105636360","https://openalex.org/W2109100253","https://openalex.org/W2127470768","https://openalex.org/W2136427775","https://openalex.org/W2167732364","https://openalex.org/W2522081855","https://openalex.org/W2969945254"],"related_works":["https://openalex.org/W7100628506","https://openalex.org/W2072651894","https://openalex.org/W7096020990","https://openalex.org/W7099771650","https://openalex.org/W6903589458","https://openalex.org/W4417452777","https://openalex.org/W1510190958","https://openalex.org/W4399453780","https://openalex.org/W7135673712","https://openalex.org/W3182669049"],"abstract_inverted_index":{"We":[0,145],"propose":[1],"an":[2,41,124,155],"iterated":[3],"version":[4],"of":[5,59,81,86,114,139],"Nesterov's":[6,121],"first-order":[7,50,68,116],"smoothing":[8,140],"method":[9],"for":[10],"the":[11,60,66,77,87,93,110,129,137,142,182,188,194],"two-person":[12],"zero-sum":[13],"game":[14],"equilibrium":[15],"problem":[16,46],"minx\u2208Q1":[17,23],"maxy\u2208Q2":[18,22],"xT":[19],"Ay":[20],"=":[21],"xTAy.":[24],"This":[25,63],"formulation":[26],"applies":[27],"to":[28,43,99,103],"matrix":[29,61,164],"games":[30,101,165,168],"as":[31,33,179],"well":[32],"sequential":[34,167],"games.":[35],"Our":[36,118],"new":[37],"algorithmic":[38],"scheme":[39,119],"computes":[40],"E-equilibrium":[42],"this":[44],"min-max":[45],"in":[47,84,141,163,177],"O(\u03ba(A)":[48],"In(1/E))":[49],"iterations,":[51,73],"where":[52],"\u03ba(A)":[53],"is":[54,175],"a":[55,151,171],"certain":[56],"condition":[57],"measure":[58],"A.":[62],"improves":[64],"upon":[65],"previous":[67],"methods":[69,83,95],"which":[70],"required":[71],"O(1/E)":[72],"and":[74,166,181],"it":[75,147],"matches":[76],"iteration":[78],"complexity":[79,195],"bound":[80],"interior-point":[82,94],"terms":[85],"algorithm's":[88],"dependence":[89],"on":[90],"E.":[91],"Unlike":[92],"that":[96,127,149,170],"are":[97],"inapplicable":[98],"large":[100],"due":[102],"their":[104],"memory":[105,112],"requirements,":[106],"our":[107],"algorithm":[108,122],"retains":[109],"small":[111],"requirements":[113],"prior":[115],"methods.":[117],"supplements":[120],"with":[123,187],"outer":[125],"loop":[126],"lowers":[128],"target":[130,135],"E":[131],"between":[132],"iterations":[133],"(this":[134],"affects":[136],"amount":[138],"inner":[143],"loop).":[144],"find":[146],"surprising":[148],"such":[150],"simple":[152],"modification":[153],"yields":[154],"exponential":[156],"speed":[157,173,184],"improvement.":[158],"Finally,":[159],"computational":[160],"experiments":[161],"both":[162],"show":[169],"significant":[172],"improvement":[174,185],"obtained":[176],"practice":[178],"well,":[180],"relative":[183],"increases":[186],"desired":[189],"accuracy":[190],"(as":[191],"suggested":[192],"by":[193],"bounds).":[196]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}