{"id":"https://openalex.org/W7139068833","doi":"https://doi.org/10.48550/arxiv.2603.17058","title":"Asymmetric Nash Seeking via Best Response Maps: Global Linear Convergence and Robustness to Inexact Reaction Models","display_name":"Asymmetric Nash Seeking via Best Response Maps: Global Linear Convergence and Robustness to Inexact Reaction Models","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7139068833","doi":"https://doi.org/10.48550/arxiv.2603.17058"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.17058","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17058","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.17058","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056720263","display_name":"Mahdis Rabbani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rabbani, Mahdis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119959797","display_name":"Navid Mojahed","orcid":"https://orcid.org/0009-0003-8836-9063"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mojahed, Navid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125203964","display_name":"Shima Nazari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nazari, Shima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.2851000130176544,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.2851000130176544,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.23520000278949738,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.1395999938249588,"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.7095000147819519},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6697999835014343},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.6216999888420105},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6158999800682068},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5870000123977661},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5357000231742859},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.4555000066757202},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44510000944137573}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7095000147819519},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6697999835014343},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.6216999888420105},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6158999800682068},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5870000123977661},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5796999931335449},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5148000121116638},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.4555000066757202},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3935000002384186},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.337799996137619},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C64980692","wikidata":"https://www.wikidata.org/wiki/Q16191959","display_name":"Symbolic convergence theory","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.28049999475479126},{"id":"https://openalex.org/C22349654","wikidata":"https://www.wikidata.org/wiki/Q2039354","display_name":"Risk dominance","level":5,"score":0.27720001339912415},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.17058","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17058","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.17058","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17058","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8049326539039612}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Nash":[0,112,166],"equilibria":[1],"provide":[2],"a":[3,43,71,171],"principled":[4],"framework":[5],"for":[6],"modeling":[7],"interactions":[8],"in":[9,38,54],"multi-agent":[10],"decision-making":[11],"and":[12,30,62,108,114,144,179],"control.":[13],"However,":[14],"many":[15],"equilibrium-seeking":[16],"methods":[17],"implicitly":[18],"assume":[19],"that":[20,34,88,130],"each":[21],"agent":[22],"has":[23],"access":[24],"to":[25],"the":[26,106,111,120,124,141,148,156,164,175],"other":[27],"agents'":[28],"objectives":[29],"constraints,":[31],"an":[32,81,159],"assumption":[33],"is":[35,67,127,151],"often":[36,134],"unrealistic":[37],"practice.":[39],"This":[40],"letter":[41],"studies":[42],"class":[44,76],"of":[45,77,95,110,119,163],"asymmetric-information":[46],"two-player":[47],"constrained":[48],"games":[49],"with":[50],"decoupled":[51],"feasible":[52],"sets,":[53],"which":[55],"Player":[56,65],"1":[57],"knows":[58],"its":[59],"own":[60],"objective":[61],"constraints":[63],"while":[64],"2":[66],"available":[68],"only":[69],"through":[70],"best-response":[72,125,131],"map.":[73],"For":[74],"this":[75],"games,":[78],"we":[79,104,138],"propose":[80],"asymmetric":[82],"projected":[83],"gradient":[84],"descent-best":[85],"response":[86],"iteration":[87,122],"does":[89],"not":[90],"require":[91],"full":[92],"mutual":[93],"knowledge":[94],"both":[96],"players'":[97],"optimization":[98],"problems.":[99],"Under":[100],"suitable":[101],"regularity":[102],"conditions,":[103],"establish":[105],"existence":[107],"uniqueness":[109],"equilibrium":[113],"prove":[115],"global":[116],"linear":[117],"convergence":[118,177],"proposed":[121],"when":[123,147],"map":[126],"exact.":[128],"Recognizing":[129],"maps":[132],"are":[133],"learned":[135],"or":[136],"estimated,":[137],"further":[139],"analyze":[140],"inexact":[142],"case":[143],"show":[145],"that,":[146],"approximation":[149],"error":[150,180],"uniformly":[152],"bounded":[153],"by":[154],"$\\varepsilon$,":[155],"iterates":[157],"enter":[158],"explicit":[160],"$O(\\varepsilon)$":[161],"neighborhood":[162],"true":[165],"equilibrium.":[167],"Numerical":[168],"results":[169],"on":[170],"benchmark":[172],"game":[173],"corroborate":[174],"predicted":[176],"behavior":[178],"scaling.":[181]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-20T00:00:00"}