A survey on algorithms for Nash equilibria in finite normal-form games
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet economics and multi-agent learning. This paper reviews variou...
Uloženo v:
| Vydáno v: | Computer science review Ročník 51; s. 100613 |
|---|---|
| Hlavní autoři: | , , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.02.2024
|
| Témata: | |
| ISSN: | 1574-0137, 1876-7745 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet economics and multi-agent learning. This paper reviews various algorithms computing the Nash equilibrium and its approximation solutions in finite normal-form games from both theoretical and empirical perspectives. For the theoretical part, we classify algorithms in the literature and present basic ideas on algorithm design and analysis. For the empirical part, we present a comprehensive comparison on the algorithms in the literature over different kinds of games. Based on these results, we provide practical suggestions on implementations and uses of these algorithms. Finally, we present a series of open problems from both theoretical and practical considerations.
•A classification on Nash equilibrium algorithms in the literature with basic ideas on design and analysis presented.•A comprehensive comparison on Nash equilibrium algorithms in the literature over different kinds of games.•Practical suggestions on implementations and uses of Nash equilibrium algorithms. |
|---|---|
| AbstractList | Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet economics and multi-agent learning. This paper reviews various algorithms computing the Nash equilibrium and its approximation solutions in finite normal-form games from both theoretical and empirical perspectives. For the theoretical part, we classify algorithms in the literature and present basic ideas on algorithm design and analysis. For the empirical part, we present a comprehensive comparison on the algorithms in the literature over different kinds of games. Based on these results, we provide practical suggestions on implementations and uses of these algorithms. Finally, we present a series of open problems from both theoretical and practical considerations.
•A classification on Nash equilibrium algorithms in the literature with basic ideas on design and analysis presented.•A comprehensive comparison on Nash equilibrium algorithms in the literature over different kinds of games.•Practical suggestions on implementations and uses of Nash equilibrium algorithms. |
| ArticleNumber | 100613 |
| Author | Shao, Kun Mguni, David Henry Deng, Xiaotie Huang, Wenhan Duan, Zhijian Wang, Jun Li, Hanyu |
| Author_xml | – sequence: 1 givenname: Hanyu orcidid: 0000-0002-5013-3333 surname: Li fullname: Li, Hanyu email: lhydave@pku.edu.cn organization: CFCS, School of Computer Science, Peking University, No. 5 Yiheyuan Road, Haidian District, 100871, Beijing, China – sequence: 2 givenname: Wenhan surname: Huang fullname: Huang, Wenhan email: wenhanhuang1993@gmail.com organization: Independent Researcher, Shenzhen, China – sequence: 3 givenname: Zhijian surname: Duan fullname: Duan, Zhijian email: zjduan@pku.edu.cn organization: CFCS, School of Computer Science, Peking University, No. 5 Yiheyuan Road, Haidian District, 100871, Beijing, China – sequence: 4 givenname: David Henry surname: Mguni fullname: Mguni, David Henry email: d.mguni@qmul.ac.uk organization: Huawei Noah’s Ark Lab, London, United Kingdom – sequence: 5 givenname: Kun surname: Shao fullname: Shao, Kun email: shaokun2@huawei.com organization: Huawei Noah’s Ark Lab, London, United Kingdom – sequence: 6 givenname: Jun surname: Wang fullname: Wang, Jun email: jun.wang@cs.ucl.ac.uk organization: Department of Computer Science, University College London, London, United Kingdom – sequence: 7 givenname: Xiaotie orcidid: 0000-0002-5282-6467 surname: Deng fullname: Deng, Xiaotie email: xiaotie@pku.edu.cn organization: CFCS, School of Computer Science, Peking University, No. 5 Yiheyuan Road, Haidian District, 100871, Beijing, China |
| BookMark | eNqFkMFKAzEQhoNUsK2-gYe8wNZkk02CB6EUq0LRi55Dmp20KbuJJtuFvr1b1pMHPc0wzPfD_83QJMQACN1SsqCEirvDwsacoF-UpGTDiQjKLtCUKikKKXk1GfZK8oJQJq_QLOcDIZKQSkzReonzMfVwwjFg0-xi8t2-zdjFhF9N3mP4OvrGb5M32AfsfPAd4BBTa5pieGrxzrSQr9GlM02Gm585Rx_rx_fVc7F5e3pZLTeFZUR0BS-3ShnqGKsrq0piOAcDUgioZM1tSVTpODfECsbsFkrhQAwNneLOUGUVm6P7MdemmIfKTlvfmc7H0CXjG02JPhvRBz0a0WcjejQywPwX_Jl8a9LpP-xhxGAo1ntIOlsPwULtE9hO19H_HfANpgN_KA |
| CitedBy_id | crossref_primary_10_1109_TCYB_2025_3579958 crossref_primary_10_3390_info16090733 crossref_primary_10_1007_s10878_025_01274_7 crossref_primary_10_1016_j_amc_2024_129134 crossref_primary_10_1109_LCSYS_2024_3414976 crossref_primary_10_1080_00207721_2025_2534897 crossref_primary_10_1016_j_ins_2024_121783 crossref_primary_10_1007_s11831_025_10364_y crossref_primary_10_1016_j_tcs_2025_115072 crossref_primary_10_1109_TII_2024_3388675 crossref_primary_10_1016_j_ijhydene_2025_06_152 crossref_primary_10_1109_JAS_2024_124998 |
| Cites_doi | 10.1016/j.cosrev.2007.09.002 10.1016/0165-1889(94)00819-4 10.1038/s41586-019-1724-z 10.1073/pnas.36.1.48 10.1007/BF02579150 10.1287/moor.6.1.58 10.1016/j.geb.2006.03.015 10.1007/BF01448847 10.1006/game.1999.0738 10.1137/0121011 10.1109/TAC.2008.2009515 10.1145/1785414.1785439 10.1016/j.cosrev.2009.03.003 10.1016/j.tcs.2008.12.033 10.1016/j.tcs.2009.09.023 10.2307/1969530 10.1145/2483699.2483703 10.1016/j.ic.2023.105046 10.1007/s00453-015-0029-3 10.1613/jair.1947 10.1080/15427951.2008.10129172 10.1016/j.geb.2008.02.015 10.1111/1468-0262.00153 10.1007/BF01753708 10.1145/1516512.1516516 10.1137/23M1549237 10.21105/joss.00904 10.1002/rsa.20199 10.1016/j.tcs.2008.12.031 10.1007/BF01213819 10.1177/002200275800200301 10.1137/070699652 10.2140/pjm.1955.5.807 10.1007/s00453-015-0078-7 10.2307/1969529 10.4086/toc.2012.v008a006 10.1137/0112033 10.1145/3175494 10.1006/jeth.1996.0014 10.1007/BF00338239 10.1007/s00453-018-0465-y 10.1145/3422622 10.1137/080720826 10.1007/BF02591741 10.1007/BF01070506 10.1016/0167-6377(82)90043-8 10.1007/s00224-013-9460-5 10.1145/3606697 10.1016/S0022-0000(05)80063-7 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Inc. |
| Copyright_xml | – notice: 2023 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cosrev.2023.100613 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1876-7745 |
| ExternalDocumentID | 10_1016_j_cosrev_2023_100613 S1574013723000801 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEFWE AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BKOJK BLXMC CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 RIG ROL RPZ SDF SDG SES SPC SPCBC SSB SSD SSV SSZ T5K UNMZH ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c306t-42b88a1f33d5c820a44eae766e57d4c2082f44a0c633cbe26fe6101f84fa18c83 |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001165834700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1574-0137 |
| IngestDate | Sat Nov 29 07:04:33 EST 2025 Tue Nov 18 22:23:53 EST 2025 Sat Apr 06 16:25:41 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | 68Q25 68W40 91-08 Nash equilibrium Approximation algorithms 68W25 Game theory |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-42b88a1f33d5c820a44eae766e57d4c2082f44a0c633cbe26fe6101f84fa18c83 |
| ORCID | 0000-0002-5013-3333 0000-0002-5282-6467 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cosrev_2023_100613 crossref_primary_10_1016_j_cosrev_2023_100613 elsevier_sciencedirect_doi_10_1016_j_cosrev_2023_100613 |
| PublicationCentury | 2000 |
| PublicationDate | February 2024 2024-02-00 |
| PublicationDateYYYYMMDD | 2024-02-01 |
| PublicationDate_xml | – month: 02 year: 2024 text: February 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Computer science review |
| PublicationYear | 2024 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Daskalakis, Goldberg, Papadimitriou (b17) 2009; 39 Codenotti, De Rossi, Pagan (b68) 2008 Czumaj, Fasoulakis, Jurdziński (b78) 2014 Nemirovskij, Yudin (b41) 1983 Duan, Huang, Zhang, Du, Wang, Yang, Deng (b108) 2023 Panagopoulou, Spirakis (b61) 2011 Wilson (b102) 1971; 21 Chen, Deng, Teng (b23) 2006 Deligkas, Fasoulakis, Markakis (b35) 2023; 19 Hart, Mas-Colell (b94) 2000; 68 Vinyals, Babuschkin, Czarnecki, Mathieu, Dudzik, Chung, Choi, Powell, Ewalds, Georgiev, Oh, Horgan, Kroiss, Danihelka, Huang, Sifre, Cai, Agapiou, Jaderberg, Vezhnevets, Leblond, Pohlen, Dalibard, Budden, Sulsky, Molloy, Paine, Gulcehre, Wang, Pfaff, Wu, Ring, Yogatama, Wünsch, McKinney, Smith, Schaul, Lillicrap, Kavukcuoglu, Hassabis, Apps, Silver (b3) 2019; 575 Nudelman, Wortman, Shoham, Leyton-Brown (b60) 2004 Feder, Nazerzadeh, Saberi (b62) 2007 Chen, Deng (b20) 2006 Garg, Mehta, Vazirani, Yazdanbod (b50) 2018; 6 Freund, Schapire (b93) 1999; 29 Nedic, Ozdaglar (b42) 2009; 54 Monderer, Shapley (b86) 1996; 68 Conitzer, Sandholm (b58) 2008; 63 Brown (b80) 1951; 13 Tsaknakis, Spirakis, Kanoulas (b25) 2008 Nash (b8) 1951; 54 Knight, Campbell (b107) 2018; 3 Deng, Li, Li (b74) 2022 Chen, Deng, Teng (b21) 2009; 56 Roughgarden (b12) 2010; 53 Korpelevich (b39) 1976; 12 Tsaknakis, Spirakis (b54) 2008; 5 Blum, Shelton, Koller (b103) 2006; 25 Goodfellow, Pouget-Abadie, Mirza, Xu, Warde-Farley, Ozair, Courville, Bengio (b14) 2020; 63 Bárány, Vempala, Vetta (b59) 2007; 31 Cesa-Bianchi, Lugosi (b97) 2006 Kontogiannis, Panagopoulou, Spirakis (b32) 2009; 410 Robinson (b83) 1951; 54 von Neumann, Morgenstern (b6) 1944 Lanctot, Zambaldi, Gruslys, Lazaridou, Tuyls, Pérolat, Silver, Graepel (b30) 2017 Papadimitriou (b22) 2007 Nikaidô, Isoda (b38) 1955; 5 Gatti, Patrini, Rocco, Sandholm (b69) 2012 Shor (b64) 1970; 6 Deligkas, Fasoulakis, Markakis (b55) 2023; 52 Boodaghians, Brakensiek, Hopkins, Rubinstein (b57) 2020 Karlin (b88) 1959 Deng, Li, Li (b72) 2023 Cottle, Pang, Stone (b70) 2009 Myerson (b10) 1989 Fudenberg, Levine (b92) 1995; 19 Anagnostides, Farina, Panageas, Sandholm (b46) 2022 Chen, Deng, Li, Mguni, Wang, Yan, Yang (b87) 2022 Vinyals, Babuschkin, Czarnecki, Mathieu, Dudzik, Chung, Choi, Powell, Ewalds, Georgiev, Oh, Horgan, Kroiss, Danihelka, Huang, Sifre, Cai, Agapiou, Jaderberg, Vezhnevets, Leblond, Pohlen, Dalibard, Budden, Sulsky, Molloy, Paine, Gulcehre, Wang, Pfaff, Wu, Ring, Yogatama, Wünsch, McKinney, Smith, Schaul, Lillicrap, Kavukcuoglu, Hassabis, Apps, Silver (b100) 2019; 575 Chen, Deng (b19) 2005 Fasoulakis, Markakis (b76) 2019 Czumaj, Deligkas, Fasoulakis, Fearnley, Jurdziński, Savani (b36) 2019; 81 Schelling (b1) 1958; 2 Karmarkar (b65) 1984; 4 McAleer, Lanier, Fox, Baldi (b101) 2020 Daskalakis, Papadimitriou (b18) 2005 Lemke, Howson (b24) 1964; 12 Cournot (b81) 1838 Daskalakis, Goldberg, Papadimitriou (b16) 2005; TR05-115 Nachbar (b82) 2012 Daskalakis, Mehta, Papadimitriou (b71) 2009; 410 Porter, Nudelman, Shoham (b104) 2008; 63 Sutton, Barto (b13) 2018 Nash (b7) 1950; 36 Fearnley, Goldberg, Savani, Sørensen (b77) 2016; 76 Kontogiannis, Spirakis (b51) 2007 Chen, Deng, Huang, Li, Li (b28) 2023; 293 van der Ploeg, de Zeeuw (b2) 1992; 2 Brandt, Fischer, Harrenstein (b90) 2013; 53 Lin, Jin, Jordan (b43) 2020 Mescheder, Nowozin, Geiger (b44) 2017 Barman (b53) 2015 Nachbar (b84) 1990; 19 Fearnley, Igwe, Savani (b26) 2015; vol. 9125 Neumann (b63) 1928; 100 Rubinstein (b52) 2016 Berner, Brockman, Chan, Cheung, Debiak, Dennison, Farhi, Fischer, Hashme, Hesse, Józefowicz, Gray, Olsson, Pachocki, Petrov, de Oliveira Pinto, Raiman, Salimans, Schlatter, Schneider, Sidor, Sutskever, Tang, Wolski, Zhang (b4) 2019 McMahan, Gordon, Blum (b29) 2003 Myerson (b9) 1981; 6 Anbalagan, Norin, Savani, Vetta (b79) 2013 Arora, Hazan, Kale (b96) 2012; 8 Tirole (b11) 1988 Daskalakis, Mehta, Papadimitriou (b34) 2007 Conitzer (b91) 2009 Daskalakis (b48) 2009; 3 Dantzig (b66) 1982; 1 Bosse, Byrka, Markakis (b33) 2010; 411 Lipton, Markakis, Mehta (b31) 2003 Balduzzi, Racaniere, Martens, Foerster, Tuyls, Graepel (b45) 2018; Vol. 80 Auer, Cesa-Bianchi, Freund, Schapire (b95) 1995 Daskalakis, Ilyas, Syrgkanis, Zeng (b40) 2018 Etessami, Yannakakis (b49) 2010; 39 Daskalakis, Fishelson, Golowich (b98) 2021 Chen, Deng (b47) 2007; 1 Daskalakis, Pan (b89) 2014 Kontogiannis, Spirakis (b27) 2011 Deligkas, Fearnley, Savani, Spirakis (b75) 2017; 77 Savani, Von Stengel (b67) 2004 Li, Koyamada, Ye, Liu, Wang, Yang, Zhao, Qin, Liu, Hon (b5) 2020 Duan, Ma, Deng (b110) 2023; vol. 202 Daskalakis (b56) 2013; 9 Metrick, Polak (b85) 1994; 4 Doup, Talman (b105) 1987; 37 Johanson, Waugh, Bowling, Zinkevich (b37) 2011 Marris, Gemp, Anthony, Tacchetti, Liu, Tuyls (b109) 2022 Babichenko, Barman, Peretz (b106) 2014 Papadimitriou (b15) 1994; 48 McAleer, Lanier, Wang, Baldi, Fox (b99) 2021 Chen, Deng, Huang, Li, Li (b73) 2021 Nikaidô (10.1016/j.cosrev.2023.100613_b38) 1955; 5 Knight (10.1016/j.cosrev.2023.100613_b107) 2018; 3 Deng (10.1016/j.cosrev.2023.100613_b72) 2023 Feder (10.1016/j.cosrev.2023.100613_b62) 2007 Blum (10.1016/j.cosrev.2023.100613_b103) 2006; 25 McAleer (10.1016/j.cosrev.2023.100613_b99) 2021 Daskalakis (10.1016/j.cosrev.2023.100613_b56) 2013; 9 Cesa-Bianchi (10.1016/j.cosrev.2023.100613_b97) 2006 Panagopoulou (10.1016/j.cosrev.2023.100613_b61) 2011 Kontogiannis (10.1016/j.cosrev.2023.100613_b51) 2007 Deligkas (10.1016/j.cosrev.2023.100613_b75) 2017; 77 Johanson (10.1016/j.cosrev.2023.100613_b37) 2011 Chen (10.1016/j.cosrev.2023.100613_b47) 2007; 1 Freund (10.1016/j.cosrev.2023.100613_b93) 1999; 29 Deligkas (10.1016/j.cosrev.2023.100613_b35) 2023; 19 Daskalakis (10.1016/j.cosrev.2023.100613_b18) 2005 Monderer (10.1016/j.cosrev.2023.100613_b86) 1996; 68 Daskalakis (10.1016/j.cosrev.2023.100613_b17) 2009; 39 Brown (10.1016/j.cosrev.2023.100613_b80) 1951; 13 Papadimitriou (10.1016/j.cosrev.2023.100613_b15) 1994; 48 Chen (10.1016/j.cosrev.2023.100613_b20) 2006 Cournot (10.1016/j.cosrev.2023.100613_b81) 1838 Czumaj (10.1016/j.cosrev.2023.100613_b36) 2019; 81 Papadimitriou (10.1016/j.cosrev.2023.100613_b22) 2007 Brandt (10.1016/j.cosrev.2023.100613_b90) 2013; 53 Bosse (10.1016/j.cosrev.2023.100613_b33) 2010; 411 Daskalakis (10.1016/j.cosrev.2023.100613_b40) 2018 Nedic (10.1016/j.cosrev.2023.100613_b42) 2009; 54 Porter (10.1016/j.cosrev.2023.100613_b104) 2008; 63 van der Ploeg (10.1016/j.cosrev.2023.100613_b2) 1992; 2 Tirole (10.1016/j.cosrev.2023.100613_b11) 1988 Mescheder (10.1016/j.cosrev.2023.100613_b44) 2017 Cottle (10.1016/j.cosrev.2023.100613_b70) 2009 Goodfellow (10.1016/j.cosrev.2023.100613_b14) 2020; 63 Neumann (10.1016/j.cosrev.2023.100613_b63) 1928; 100 Vinyals (10.1016/j.cosrev.2023.100613_b100) 2019; 575 Daskalakis (10.1016/j.cosrev.2023.100613_b98) 2021 Nachbar (10.1016/j.cosrev.2023.100613_b82) 2012 Bárány (10.1016/j.cosrev.2023.100613_b59) 2007; 31 Chen (10.1016/j.cosrev.2023.100613_b87) 2022 Robinson (10.1016/j.cosrev.2023.100613_b83) 1951; 54 Nash (10.1016/j.cosrev.2023.100613_b7) 1950; 36 Chen (10.1016/j.cosrev.2023.100613_b73) 2021 Karlin (10.1016/j.cosrev.2023.100613_b88) 1959 Duan (10.1016/j.cosrev.2023.100613_b110) 2023; vol. 202 Tsaknakis (10.1016/j.cosrev.2023.100613_b54) 2008; 5 Fasoulakis (10.1016/j.cosrev.2023.100613_b76) 2019 Lin (10.1016/j.cosrev.2023.100613_b43) 2020 Korpelevich (10.1016/j.cosrev.2023.100613_b39) 1976; 12 Babichenko (10.1016/j.cosrev.2023.100613_b106) 2014 Shor (10.1016/j.cosrev.2023.100613_b64) 1970; 6 Daskalakis (10.1016/j.cosrev.2023.100613_b71) 2009; 410 Doup (10.1016/j.cosrev.2023.100613_b105) 1987; 37 Nachbar (10.1016/j.cosrev.2023.100613_b84) 1990; 19 Lanctot (10.1016/j.cosrev.2023.100613_b30) 2017 Li (10.1016/j.cosrev.2023.100613_b5) 2020 Chen (10.1016/j.cosrev.2023.100613_b21) 2009; 56 Myerson (10.1016/j.cosrev.2023.100613_b9) 1981; 6 Lipton (10.1016/j.cosrev.2023.100613_b31) 2003 Deligkas (10.1016/j.cosrev.2023.100613_b55) 2023; 52 Daskalakis (10.1016/j.cosrev.2023.100613_b34) 2007 Daskalakis (10.1016/j.cosrev.2023.100613_b48) 2009; 3 Conitzer (10.1016/j.cosrev.2023.100613_b58) 2008; 63 Myerson (10.1016/j.cosrev.2023.100613_b10) 1989 Savani (10.1016/j.cosrev.2023.100613_b67) 2004 Vinyals (10.1016/j.cosrev.2023.100613_b3) 2019; 575 Deng (10.1016/j.cosrev.2023.100613_b74) 2022 Chen (10.1016/j.cosrev.2023.100613_b19) 2005 Conitzer (10.1016/j.cosrev.2023.100613_b91) 2009 Roughgarden (10.1016/j.cosrev.2023.100613_b12) 2010; 53 Anagnostides (10.1016/j.cosrev.2023.100613_b46) 2022 Daskalakis (10.1016/j.cosrev.2023.100613_b89) 2014 Wilson (10.1016/j.cosrev.2023.100613_b102) 1971; 21 Duan (10.1016/j.cosrev.2023.100613_b108) 2023 Auer (10.1016/j.cosrev.2023.100613_b95) 1995 Nemirovskij (10.1016/j.cosrev.2023.100613_b41) 1983 Arora (10.1016/j.cosrev.2023.100613_b96) 2012; 8 Hart (10.1016/j.cosrev.2023.100613_b94) 2000; 68 Lemke (10.1016/j.cosrev.2023.100613_b24) 1964; 12 Fearnley (10.1016/j.cosrev.2023.100613_b77) 2016; 76 Anbalagan (10.1016/j.cosrev.2023.100613_b79) 2013 Tsaknakis (10.1016/j.cosrev.2023.100613_b25) 2008 Chen (10.1016/j.cosrev.2023.100613_b23) 2006 Marris (10.1016/j.cosrev.2023.100613_b109) 2022 Fudenberg (10.1016/j.cosrev.2023.100613_b92) 1995; 19 von Neumann (10.1016/j.cosrev.2023.100613_b6) 1944 Etessami (10.1016/j.cosrev.2023.100613_b49) 2010; 39 Boodaghians (10.1016/j.cosrev.2023.100613_b57) 2020 Dantzig (10.1016/j.cosrev.2023.100613_b66) 1982; 1 Schelling (10.1016/j.cosrev.2023.100613_b1) 1958; 2 Balduzzi (10.1016/j.cosrev.2023.100613_b45) 2018; Vol. 80 Metrick (10.1016/j.cosrev.2023.100613_b85) 1994; 4 Nudelman (10.1016/j.cosrev.2023.100613_b60) 2004 Karmarkar (10.1016/j.cosrev.2023.100613_b65) 1984; 4 Daskalakis (10.1016/j.cosrev.2023.100613_b16) 2005; TR05-115 Sutton (10.1016/j.cosrev.2023.100613_b13) 2018 Berner (10.1016/j.cosrev.2023.100613_b4) 2019 Codenotti (10.1016/j.cosrev.2023.100613_b68) 2008 Gatti (10.1016/j.cosrev.2023.100613_b69) 2012 Kontogiannis (10.1016/j.cosrev.2023.100613_b32) 2009; 410 Barman (10.1016/j.cosrev.2023.100613_b53) 2015 Chen (10.1016/j.cosrev.2023.100613_b28) 2023; 293 Czumaj (10.1016/j.cosrev.2023.100613_b78) 2014 McAleer (10.1016/j.cosrev.2023.100613_b101) 2020 Nash (10.1016/j.cosrev.2023.100613_b8) 1951; 54 Garg (10.1016/j.cosrev.2023.100613_b50) 2018; 6 Fearnley (10.1016/j.cosrev.2023.100613_b26) 2015; vol. 9125 McMahan (10.1016/j.cosrev.2023.100613_b29) 2003 Kontogiannis (10.1016/j.cosrev.2023.100613_b27) 2011 Rubinstein (10.1016/j.cosrev.2023.100613_b52) 2016 |
| References_xml | – year: 2019 ident: b76 article-title: An improved quasi-polynomial algorithm for approximate well-supported Nash equilibria publication-title: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence – volume: 25 start-page: 457 year: 2006 end-page: 502 ident: b103 article-title: A continuation method for Nash equilibria in structured games publication-title: J. Artificial Intelligence Res. – volume: 6 start-page: 58 year: 1981 end-page: 73 ident: b9 article-title: Optimal auction design publication-title: Math. Oper. Res. – volume: 4 start-page: 923 year: 1994 end-page: 933 ident: b85 article-title: Fictitious play in 2 publication-title: Econom. Theory – start-page: 190 year: 2011 end-page: 199 ident: b61 article-title: Random bimatrix games are asymptotically easy to solve (a simple proof) publication-title: Algorithmic Game Theory – start-page: 352 year: 2007 end-page: 354 ident: b62 article-title: Approximating Nash equilibria using small-support strategies publication-title: Proceedings of the 8th ACM Conference on Electronic Commerce – start-page: 1695 year: 2012 end-page: 1705 ident: b82 article-title: Learning in games publication-title: Computational Complexity: Theory, Techniques, and Applications – volume: 63 start-page: 139 year: 2020 end-page: 144 ident: b14 article-title: Generative adversarial networks publication-title: Commun. ACM – start-page: 286 year: 2012 end-page: 295 ident: b69 article-title: Combining local search techniques and path following for bimatrix games publication-title: Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence – start-page: 27604 year: 2021 end-page: 27616 ident: b98 article-title: Near-optimal no-regret learning in general games publication-title: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, Virtual – year: 2018 ident: b13 article-title: Reinforcement Learning: An Introduction – volume: Vol. 80 start-page: 354 year: 2018 end-page: 363 ident: b45 article-title: The mechanics of n-player differentiable games publication-title: Proceedings of the 35th International Conference on Machine Learning – start-page: 23128 year: 2021 end-page: 23139 ident: b99 article-title: XDO: A double oracle algorithm for extensive-form games publication-title: Advances in Neural Information Processing Systems, Vol. 34 – start-page: 1 year: 2011 end-page: 20 ident: b27 article-title: Approximability of symmetric bimatrix games and related experiments publication-title: Proceedings of the 10th International Conference on Experimental Algorithms – volume: 63 start-page: 642 year: 2008 end-page: 662 ident: b104 article-title: Simple search methods for finding a Nash equilibrium publication-title: Games Econom. Behav. – year: 2005 ident: b18 article-title: Three-player games are hard – start-page: 258 year: 2016 end-page: 265 ident: b52 article-title: Settling the complexity of computing approximate two-player Nash equilibria publication-title: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) – volume: 37 start-page: 319 year: 1987 end-page: 355 ident: b105 article-title: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices publication-title: Math. Program.: Ser. A B – start-page: 97 year: 2021 end-page: 111 ident: b73 article-title: On tightness of the tsaknakis-spirakis algorithm for approximate Nash equilibrium publication-title: Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings – volume: 31 start-page: 391 year: 2007 end-page: 405 ident: b59 article-title: Nash equilibria in random games publication-title: Random Struct. Algorithms – volume: 68 start-page: 258 year: 1996 end-page: 265 ident: b86 article-title: Fictitious play property for games with identical interests publication-title: J. Econom. Theory – volume: 411 start-page: 164 year: 2010 end-page: 173 ident: b33 article-title: New algorithms for approximate Nash equilibria in bimatrix games publication-title: Theoret. Comput. Sci. – start-page: 271 year: 2020 end-page: 282 ident: b57 article-title: Smoothed complexity of 2-player Nash equilibria publication-title: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020 – start-page: 1823 year: 2017 end-page: 1833 ident: b44 article-title: The numerics of GANs publication-title: Proceedings of the 31st International Conference on Neural Information Processing Systems – volume: 2 start-page: 117 year: 1992 end-page: 139 ident: b2 article-title: International aspects of pollution control publication-title: Environ. Resour. Econom. – year: 2005 ident: b19 article-title: 3-Nash is PPAD-complete – volume: 19 year: 2023 ident: b35 article-title: A polynomial-time algorithm for 1/3-Approximate Nash equilibria in bimatrix games publication-title: ACM Trans. Algorithms – year: 2020 ident: b5 article-title: Suphx: Mastering mahjong with deep reinforcement learning – volume: 77 start-page: 487 year: 2017 end-page: 514 ident: b75 article-title: Computing approximate Nash equilibria in polymatrix games publication-title: Algorithmica – start-page: 191 year: 1989 end-page: 206 ident: b10 article-title: Mechanism design publication-title: Allocation, Information and Markets – start-page: 233 year: 2023 end-page: 241 ident: b108 article-title: Is Nash equilibrium approximator learnable? publication-title: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems – volume: 76 start-page: 297 year: 2016 end-page: 319 ident: b77 article-title: Approximate well-supported Nash equilibria below two-thirds publication-title: Algorithmica – volume: 19 start-page: 59 year: 1990 end-page: 89 ident: b84 article-title: “Evolutionary” selection dynamics in games: Convergence and limit properties publication-title: Internat. J. Game Theory – start-page: 536 year: 2003 end-page: 543 ident: b29 article-title: Planning in the presence of cost functions controlled by an adversary publication-title: Proceedings of the Twentieth International Conference on International Conference on Machine Learning – volume: 410 start-page: 1581 year: 2009 end-page: 1588 ident: b71 article-title: A note on approximate Nash equilibria publication-title: Theoret. Comput. Sci. – start-page: 258 year: 2011 end-page: 265 ident: b37 article-title: Accelerating best response calculation in large extensive games publication-title: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Volume One – volume: 63 start-page: 621 year: 2008 end-page: 641 ident: b58 article-title: New complexity results about Nash equilibria publication-title: Games Econ. Behav. – start-page: 753 year: 2014 end-page: 770 ident: b106 article-title: Simple approximate equilibria in large games publication-title: Proceedings of the Fifteenth ACM Conference on Economics and Computation – start-page: 258 year: 2004 end-page: 267 ident: b67 article-title: Exponentially many steps for finding a Nash equilibrium in a bimatrix game publication-title: 45th Annual IEEE Symposium on Foundations of Computer Science – start-page: 244 year: 2014 end-page: 254 ident: b78 article-title: Approximate well-supported Nash equilibria in symmetric bimatrix games publication-title: Algorithmic Game Theory – volume: 2 start-page: 203 year: 1958 end-page: 264 ident: b1 article-title: The strategy of conflict . Prospectus for a reorientation of game theory publication-title: J. Conflict Resol. – volume: 12 start-page: 413 year: 1964 end-page: 423 ident: b24 article-title: Equilibrium points of bimatrix games publication-title: J. Soc. Ind. Appl. Math. – volume: 100 start-page: 295 year: 1928 end-page: 320 ident: b63 article-title: Zur theorie der gesellschaftsspiele publication-title: Math. Ann. – start-page: 11 year: 2014 end-page: 20 ident: b89 article-title: A counter-example to karlin’s strong conjecture for fictitious play publication-title: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science – volume: 9 start-page: 23:1 year: 2013 end-page: 23:35 ident: b56 article-title: On the complexity of approximating a Nash equilibrium publication-title: ACM Trans. Algorithms – year: 2022 ident: b109 article-title: Turbocharging solution concepts: Solving NEs, CEs and CCEs with neural equilibrium solvers publication-title: NeurIPS – volume: 48 start-page: 498 year: 1994 end-page: 532 ident: b15 article-title: On the complexity of the parity argument and other inefficient proofs of existence publication-title: J. Comput. System Sci. – volume: 5 start-page: 807 year: 1955 end-page: 815 ident: b38 article-title: Note on non-cooperative convex games publication-title: Pacific J. Math. – volume: 29 start-page: 79 year: 1999 end-page: 103 ident: b93 article-title: Adaptive game playing using multiplicative weights publication-title: Games Econom. Behav. – volume: 8 start-page: 121 year: 2012 end-page: 164 ident: b96 article-title: The multiplicative weights update method: a meta-algorithm and applications publication-title: Theory Comput. – volume: 52 start-page: 1083 year: 2023 end-page: 1096 ident: b55 article-title: A polynomial-time algorithm for 1/2-Well-Supported Nash equilibria in bimatrix games publication-title: SIAM J. Comput. – volume: 54 start-page: 296 year: 1951 end-page: 301 ident: b83 article-title: An iterative method of solving a game publication-title: Ann. of Math. – start-page: 222 year: 2008 end-page: 230 ident: b25 article-title: Performance evaluation of a descent algorithm for bi-matrix games publication-title: Proceedings of the 4th International Workshop on Internet and Network Economics – volume: 19 start-page: 1065 year: 1995 end-page: 1089 ident: b92 article-title: Consistency and cautious fictitious play publication-title: J. Econom. Dynam. Control – start-page: 4193 year: 2017 end-page: 4206 ident: b30 article-title: A unified game-theoretic approach to multiagent reinforcement learning publication-title: Proceedings of the 31st International Conference on Neural Information Processing Systems – volume: 3 start-page: 904 year: 2018 ident: b107 article-title: Nashpy: A python library for the computation of Nash equilibria publication-title: J. Open Source Softw. – start-page: 179 year: 2022 end-page: 185 ident: b87 article-title: On the convergence of fictitious play: A decomposition approach publication-title: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 – start-page: 636 year: 2009 end-page: 643 ident: b91 article-title: Approximation guarantees for fictitious play publication-title: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing – volume: 1 start-page: 43 year: 1982 end-page: 48 ident: b66 article-title: Reminiscences about the origins of linear programming publication-title: Oper. Res. Lett. – volume: 5 start-page: 365 year: 2008 end-page: 382 ident: b54 article-title: An optimization approach for approximate Nash equilibria publication-title: Internet Math. – year: 1838 ident: b81 article-title: Recherches sur les Principes Mathématiques de la Théorie des Richesses – year: 2020 ident: b101 article-title: Pipeline PSRO: A scalable approach for finding approximate Nash equilibria in large games publication-title: Proceedings of the 34th International Conference on Neural Information Processing Systems – start-page: 355 year: 2007 end-page: 358 ident: b34 article-title: Progress in approximate Nash equilibria publication-title: Proceedings of the 8th ACM Conference on Electronic Commerce – year: 2009 ident: b70 article-title: The Linear Complementarity Problem – year: 2022 ident: b74 article-title: Characterizing parametric and convergence stability in nonconvex and nonsmooth optimizations: A geometric approach – start-page: 15 year: 2013 end-page: 23 ident: b79 article-title: Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3 publication-title: Web and Internet Economics, Vol. 8289 – year: 1988 ident: b11 article-title: The Theory of Industrial Organization – volume: 12 start-page: 747 year: 1976 end-page: 756 ident: b39 article-title: The extragradient method for finding saddle points and other problems publication-title: Matecon – volume: 6 start-page: 102 year: 1970 end-page: 108 ident: b64 article-title: Convergence rate of the gradient descent method with dilatation of the space publication-title: Cybernetics – volume: 54 start-page: 286 year: 1951 end-page: 295 ident: b8 article-title: Non-cooperative games publication-title: Ann. of Math. – volume: 54 start-page: 48 year: 2009 end-page: 61 ident: b42 article-title: Distributed subgradient methods for multi-agent optimization publication-title: IEEE Trans. Automat. Control – volume: 53 start-page: 78 year: 2010 end-page: 86 ident: b12 article-title: Algorithmic game theory publication-title: Commun. ACM – volume: 293 year: 2023 ident: b28 article-title: On tightness of tsaknakis-spirakis descent methods for approximate Nash equilibria publication-title: Inform. and Comput. – volume: 81 start-page: 1205 year: 2019 end-page: 1231 ident: b36 article-title: Distributed methods for computing approximate equilibria publication-title: Algorithmica – start-page: 880 year: 2004 end-page: 887 ident: b60 article-title: Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms publication-title: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 – start-page: 603 year: 2006 end-page: 612 ident: b23 article-title: Computing Nash equilibria: Approximation and smoothed complexity publication-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science – volume: vol. 202 start-page: 8747 year: 2023 end-page: 8778 ident: b110 article-title: Are equivariant equilibrium approximators beneficial? publication-title: International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA – volume: vol. 9125 start-page: 339 year: 2015 end-page: 351 ident: b26 article-title: An empirical study of finding approximate equilibria in bimatrix games publication-title: Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings – volume: 56 year: 2009 ident: b21 article-title: Settling the complexity of computing two-player Nash equilibria publication-title: J. ACM – volume: 36 start-page: 48 year: 1950 end-page: 49 ident: b7 article-title: Equilibrium points in n-person games publication-title: Proc. Natl. Acad. Sci. – start-page: 29 year: 2007 end-page: 52 ident: b22 article-title: The complexity of finding Nash equilibria publication-title: Algorithmic Game Theory – volume: 575 start-page: 350 year: 2019 end-page: 354 ident: b100 article-title: Grandmaster level in StarCraft II using multi-agent reinforcement learning publication-title: Nature – year: 1983 ident: b41 article-title: Problem Complexity and Method Efficiency in Optimization – year: 1944 ident: b6 article-title: Theory of Games and Economic Behavior – volume: 39 start-page: 195 year: 2009 end-page: 259 ident: b17 article-title: The complexity of computing a Nash equilibrium publication-title: SIAM J. Comput. – volume: 53 start-page: 41 year: 2013 end-page: 52 ident: b90 article-title: On the rate of convergence of fictitious play publication-title: Theory Comput. Syst. – volume: 575 start-page: 350 year: 2019 end-page: 354 ident: b3 article-title: Grandmaster level in StarCraft II using multi-agent reinforcement learning publication-title: Nature – year: 2018 ident: b40 article-title: Training GANs with optimism publication-title: International Conference on Learning Representations – year: 2019 ident: b4 article-title: Dota 2 with large scale deep reinforcement learning – start-page: 261 year: 2006 end-page: 272 ident: b20 article-title: Settling the complexity of two-player Nash equilibrium publication-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science – start-page: 322 year: 1995 ident: b95 article-title: Gambling in a rigged casino: The adversarial multi-armed bandit problem publication-title: Proceedings of the 36th Annual Symposium on Foundations of Computer Science – start-page: 36 year: 2003 end-page: 41 ident: b31 article-title: Playing large games using simple strategies publication-title: Proceedings of the 4th ACM Conference on Electronic Commerce – year: 2006 ident: b97 article-title: Prediction, Learning, and Games – year: 2008 ident: b68 article-title: An experimental analysis of Lemke-Howson algorithm – volume: 410 start-page: 1599 year: 2009 end-page: 1606 ident: b32 article-title: Polynomial algorithms for approximating Nash equilibria of bimatrix games publication-title: Theoret. Comput. Sci. – volume: 4 start-page: 373 year: 1984 end-page: 395 ident: b65 article-title: A new polynomial-time algorithm for linear programming publication-title: Combinatorica – volume: 39 start-page: 2531 year: 2010 end-page: 2597 ident: b49 article-title: On the complexity of Nash equilibria and other fixed points publication-title: SIAM J. Comput. – volume: 1 start-page: 88 year: 2007 end-page: 99 ident: b47 article-title: Recent development in computational complexity characterization of Nash equilibrium publication-title: Comp. Sci. Rev. – year: 2020 ident: b43 article-title: On gradient descent ascent for nonconvex-concave minimax problems publication-title: Proceedings of the 37th International Conference on Machine Learning – volume: 3 start-page: 87 year: 2009 end-page: 100 ident: b48 article-title: Nash equilibria: Complexity, symmetries, and approximation publication-title: Comp. Sci. Rev. – year: 1959 ident: b88 article-title: Mathematical Methods and Theory in Games, Programming, and Economics – volume: TR05-115 year: 2005 ident: b16 article-title: The complexity of computing a Nash equilibrium publication-title: Electron. Colloq. Comput. Complex. – start-page: 361 year: 2015 end-page: 369 ident: b53 article-title: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory’s theorem publication-title: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing – volume: 6 start-page: 1 year: 2018 end-page: 23 ident: b50 article-title: r-completeness for decision versions of multi-player (symmetric) Nash equilibria publication-title: ACM Trans. Econom. Comput. – year: 2022 ident: b46 article-title: Optimistic mirror descent either converges to Nash or to strong coarse correlated equilibria in bimatrix games publication-title: Neural Information Processing Systems (NeurIPS) – volume: 13 start-page: 374 year: 1951 end-page: 376 ident: b80 article-title: Iterative solution of games by fictitious play publication-title: Activity Anal. Prod. Allocat. – volume: 21 start-page: 80 year: 1971 end-page: 87 ident: b102 article-title: Computing equilibria of n-person games publication-title: SIAM J. Appl. Math. – start-page: 595 year: 2007 end-page: 606 ident: b51 article-title: Efficient algorithms for constant well supported approximate equilibria in bimatrix games publication-title: Automata, Languages and Programming – year: 2023 ident: b72 article-title: The search-and-mix paradigm in approximate Nash equilibrium algorithms – volume: 68 start-page: 1127 year: 2000 end-page: 1150 ident: b94 article-title: A simple adaptive procedure leading to correlated equilibrium publication-title: Econometrica – start-page: 36 year: 2003 ident: 10.1016/j.cosrev.2023.100613_b31 article-title: Playing large games using simple strategies – volume: 1 start-page: 88 issue: 2 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b47 article-title: Recent development in computational complexity characterization of Nash equilibrium publication-title: Comp. Sci. Rev. doi: 10.1016/j.cosrev.2007.09.002 – start-page: 258 year: 2016 ident: 10.1016/j.cosrev.2023.100613_b52 article-title: Settling the complexity of computing approximate two-player Nash equilibria – year: 2019 ident: 10.1016/j.cosrev.2023.100613_b76 article-title: An improved quasi-polynomial algorithm for approximate well-supported Nash equilibria – volume: 19 start-page: 1065 issue: 5 year: 1995 ident: 10.1016/j.cosrev.2023.100613_b92 article-title: Consistency and cautious fictitious play publication-title: J. Econom. Dynam. Control doi: 10.1016/0165-1889(94)00819-4 – volume: 575 start-page: 350 issue: 7782 year: 2019 ident: 10.1016/j.cosrev.2023.100613_b3 article-title: Grandmaster level in StarCraft II using multi-agent reinforcement learning publication-title: Nature doi: 10.1038/s41586-019-1724-z – volume: 36 start-page: 48 issue: 1 year: 1950 ident: 10.1016/j.cosrev.2023.100613_b7 article-title: Equilibrium points in n-person games publication-title: Proc. Natl. Acad. Sci. doi: 10.1073/pnas.36.1.48 – start-page: 636 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b91 article-title: Approximation guarantees for fictitious play – volume: 4 start-page: 373 issue: 4 year: 1984 ident: 10.1016/j.cosrev.2023.100613_b65 article-title: A new polynomial-time algorithm for linear programming publication-title: Combinatorica doi: 10.1007/BF02579150 – volume: 6 start-page: 58 issue: 1 year: 1981 ident: 10.1016/j.cosrev.2023.100613_b9 article-title: Optimal auction design publication-title: Math. Oper. Res. doi: 10.1287/moor.6.1.58 – start-page: 97 year: 2021 ident: 10.1016/j.cosrev.2023.100613_b73 article-title: On tightness of the tsaknakis-spirakis algorithm for approximate Nash equilibrium – volume: 63 start-page: 642 issue: 2 year: 2008 ident: 10.1016/j.cosrev.2023.100613_b104 article-title: Simple search methods for finding a Nash equilibrium publication-title: Games Econom. Behav. doi: 10.1016/j.geb.2006.03.015 – volume: 100 start-page: 295 issue: 1 year: 1928 ident: 10.1016/j.cosrev.2023.100613_b63 article-title: Zur theorie der gesellschaftsspiele publication-title: Math. Ann. doi: 10.1007/BF01448847 – volume: 29 start-page: 79 issue: 1 year: 1999 ident: 10.1016/j.cosrev.2023.100613_b93 article-title: Adaptive game playing using multiplicative weights publication-title: Games Econom. Behav. doi: 10.1006/game.1999.0738 – start-page: 261 year: 2006 ident: 10.1016/j.cosrev.2023.100613_b20 article-title: Settling the complexity of two-player Nash equilibrium – volume: 21 start-page: 80 issue: 1 year: 1971 ident: 10.1016/j.cosrev.2023.100613_b102 article-title: Computing equilibria of n-person games publication-title: SIAM J. Appl. Math. doi: 10.1137/0121011 – volume: Vol. 80 start-page: 354 year: 2018 ident: 10.1016/j.cosrev.2023.100613_b45 article-title: The mechanics of n-player differentiable games – volume: 54 start-page: 48 issue: 1 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b42 article-title: Distributed subgradient methods for multi-agent optimization publication-title: IEEE Trans. Automat. Control doi: 10.1109/TAC.2008.2009515 – start-page: 191 year: 1989 ident: 10.1016/j.cosrev.2023.100613_b10 article-title: Mechanism design – start-page: 11 year: 2014 ident: 10.1016/j.cosrev.2023.100613_b89 article-title: A counter-example to karlin’s strong conjecture for fictitious play – start-page: 355 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b34 article-title: Progress in approximate Nash equilibria – volume: 53 start-page: 78 issue: 7 year: 2010 ident: 10.1016/j.cosrev.2023.100613_b12 article-title: Algorithmic game theory publication-title: Commun. ACM doi: 10.1145/1785414.1785439 – volume: 3 start-page: 87 issue: 2 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b48 article-title: Nash equilibria: Complexity, symmetries, and approximation publication-title: Comp. Sci. Rev. doi: 10.1016/j.cosrev.2009.03.003 – year: 2019 ident: 10.1016/j.cosrev.2023.100613_b4 – start-page: 29 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b22 article-title: The complexity of finding Nash equilibria – volume: 410 start-page: 1599 issue: 17 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b32 article-title: Polynomial algorithms for approximating Nash equilibria of bimatrix games publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2008.12.033 – volume: 411 start-page: 164 issue: 1 year: 2010 ident: 10.1016/j.cosrev.2023.100613_b33 article-title: New algorithms for approximate Nash equilibria in bimatrix games publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2009.09.023 – volume: 13 start-page: 374 issue: 1 year: 1951 ident: 10.1016/j.cosrev.2023.100613_b80 article-title: Iterative solution of games by fictitious play publication-title: Activity Anal. Prod. Allocat. – year: 2006 ident: 10.1016/j.cosrev.2023.100613_b97 – volume: 54 start-page: 296 issue: 2 year: 1951 ident: 10.1016/j.cosrev.2023.100613_b83 article-title: An iterative method of solving a game publication-title: Ann. of Math. doi: 10.2307/1969530 – volume: 9 start-page: 23:1 issue: 3 year: 2013 ident: 10.1016/j.cosrev.2023.100613_b56 article-title: On the complexity of approximating a Nash equilibrium publication-title: ACM Trans. Algorithms doi: 10.1145/2483699.2483703 – volume: 293 year: 2023 ident: 10.1016/j.cosrev.2023.100613_b28 article-title: On tightness of tsaknakis-spirakis descent methods for approximate Nash equilibria publication-title: Inform. and Comput. doi: 10.1016/j.ic.2023.105046 – start-page: 352 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b62 article-title: Approximating Nash equilibria using small-support strategies – volume: 76 start-page: 297 issue: 2 year: 2016 ident: 10.1016/j.cosrev.2023.100613_b77 article-title: Approximate well-supported Nash equilibria below two-thirds publication-title: Algorithmica doi: 10.1007/s00453-015-0029-3 – volume: 25 start-page: 457 year: 2006 ident: 10.1016/j.cosrev.2023.100613_b103 article-title: A continuation method for Nash equilibria in structured games publication-title: J. Artificial Intelligence Res. doi: 10.1613/jair.1947 – start-page: 361 year: 2015 ident: 10.1016/j.cosrev.2023.100613_b53 article-title: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory’s theorem – start-page: 244 year: 2014 ident: 10.1016/j.cosrev.2023.100613_b78 article-title: Approximate well-supported Nash equilibria in symmetric bimatrix games – year: 2005 ident: 10.1016/j.cosrev.2023.100613_b19 – volume: 5 start-page: 365 issue: 4 year: 2008 ident: 10.1016/j.cosrev.2023.100613_b54 article-title: An optimization approach for approximate Nash equilibria publication-title: Internet Math. doi: 10.1080/15427951.2008.10129172 – start-page: 179 year: 2022 ident: 10.1016/j.cosrev.2023.100613_b87 article-title: On the convergence of fictitious play: A decomposition approach – start-page: 595 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b51 article-title: Efficient algorithms for constant well supported approximate equilibria in bimatrix games – year: 2020 ident: 10.1016/j.cosrev.2023.100613_b43 article-title: On gradient descent ascent for nonconvex-concave minimax problems – volume: 63 start-page: 621 issue: 2 year: 2008 ident: 10.1016/j.cosrev.2023.100613_b58 article-title: New complexity results about Nash equilibria publication-title: Games Econ. Behav. doi: 10.1016/j.geb.2008.02.015 – volume: 68 start-page: 1127 issue: 5 year: 2000 ident: 10.1016/j.cosrev.2023.100613_b94 article-title: A simple adaptive procedure leading to correlated equilibrium publication-title: Econometrica doi: 10.1111/1468-0262.00153 – start-page: 286 year: 2012 ident: 10.1016/j.cosrev.2023.100613_b69 article-title: Combining local search techniques and path following for bimatrix games – start-page: 222 year: 2008 ident: 10.1016/j.cosrev.2023.100613_b25 article-title: Performance evaluation of a descent algorithm for bi-matrix games – start-page: 23128 year: 2021 ident: 10.1016/j.cosrev.2023.100613_b99 article-title: XDO: A double oracle algorithm for extensive-form games – volume: 19 start-page: 59 issue: 1 year: 1990 ident: 10.1016/j.cosrev.2023.100613_b84 article-title: “Evolutionary” selection dynamics in games: Convergence and limit properties publication-title: Internat. J. Game Theory doi: 10.1007/BF01753708 – year: 2018 ident: 10.1016/j.cosrev.2023.100613_b13 – year: 2005 ident: 10.1016/j.cosrev.2023.100613_b18 – start-page: 15 year: 2013 ident: 10.1016/j.cosrev.2023.100613_b79 article-title: Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3 – year: 1959 ident: 10.1016/j.cosrev.2023.100613_b88 – volume: 56 issue: 3 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b21 article-title: Settling the complexity of computing two-player Nash equilibria publication-title: J. ACM doi: 10.1145/1516512.1516516 – year: 1838 ident: 10.1016/j.cosrev.2023.100613_b81 – volume: 52 start-page: 1083 issue: 5 year: 2023 ident: 10.1016/j.cosrev.2023.100613_b55 article-title: A polynomial-time algorithm for 1/2-Well-Supported Nash equilibria in bimatrix games publication-title: SIAM J. Comput. doi: 10.1137/23M1549237 – volume: 3 start-page: 904 issue: 30 year: 2018 ident: 10.1016/j.cosrev.2023.100613_b107 article-title: Nashpy: A python library for the computation of Nash equilibria publication-title: J. Open Source Softw. doi: 10.21105/joss.00904 – start-page: 27604 year: 2021 ident: 10.1016/j.cosrev.2023.100613_b98 article-title: Near-optimal no-regret learning in general games – year: 1983 ident: 10.1016/j.cosrev.2023.100613_b41 – start-page: 190 year: 2011 ident: 10.1016/j.cosrev.2023.100613_b61 article-title: Random bimatrix games are asymptotically easy to solve (a simple proof) – year: 2020 ident: 10.1016/j.cosrev.2023.100613_b5 – volume: 31 start-page: 391 issue: 4 year: 2007 ident: 10.1016/j.cosrev.2023.100613_b59 article-title: Nash equilibria in random games publication-title: Random Struct. Algorithms doi: 10.1002/rsa.20199 – volume: 410 start-page: 1581 issue: 17 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b71 article-title: A note on approximate Nash equilibria publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2008.12.031 – year: 2009 ident: 10.1016/j.cosrev.2023.100613_b70 – volume: 4 start-page: 923 issue: 6 year: 1994 ident: 10.1016/j.cosrev.2023.100613_b85 article-title: Fictitious play in 2 × 2 games: A geometric proof of convergence publication-title: Econom. Theory doi: 10.1007/BF01213819 – start-page: 880 year: 2004 ident: 10.1016/j.cosrev.2023.100613_b60 article-title: Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms – start-page: 271 year: 2020 ident: 10.1016/j.cosrev.2023.100613_b57 article-title: Smoothed complexity of 2-player Nash equilibria – year: 2008 ident: 10.1016/j.cosrev.2023.100613_b68 – volume: 2 start-page: 203 issue: 3 year: 1958 ident: 10.1016/j.cosrev.2023.100613_b1 article-title: The strategy of conflict . Prospectus for a reorientation of game theory publication-title: J. Conflict Resol. doi: 10.1177/002200275800200301 – start-page: 233 year: 2023 ident: 10.1016/j.cosrev.2023.100613_b108 article-title: Is Nash equilibrium approximator learnable? – volume: 39 start-page: 195 issue: 1 year: 2009 ident: 10.1016/j.cosrev.2023.100613_b17 article-title: The complexity of computing a Nash equilibrium publication-title: SIAM J. Comput. doi: 10.1137/070699652 – start-page: 1 year: 2011 ident: 10.1016/j.cosrev.2023.100613_b27 article-title: Approximability of symmetric bimatrix games and related experiments – year: 2022 ident: 10.1016/j.cosrev.2023.100613_b74 – volume: 575 start-page: 350 year: 2019 ident: 10.1016/j.cosrev.2023.100613_b100 article-title: Grandmaster level in StarCraft II using multi-agent reinforcement learning publication-title: Nature doi: 10.1038/s41586-019-1724-z – volume: 5 start-page: 807 issue: S1 year: 1955 ident: 10.1016/j.cosrev.2023.100613_b38 article-title: Note on non-cooperative convex games publication-title: Pacific J. Math. doi: 10.2140/pjm.1955.5.807 – volume: 77 start-page: 487 issue: 2 year: 2017 ident: 10.1016/j.cosrev.2023.100613_b75 article-title: Computing approximate Nash equilibria in polymatrix games publication-title: Algorithmica doi: 10.1007/s00453-015-0078-7 – start-page: 322 year: 1995 ident: 10.1016/j.cosrev.2023.100613_b95 article-title: Gambling in a rigged casino: The adversarial multi-armed bandit problem – start-page: 258 year: 2004 ident: 10.1016/j.cosrev.2023.100613_b67 article-title: Exponentially many steps for finding a Nash equilibrium in a bimatrix game – volume: 54 start-page: 286 issue: 2 year: 1951 ident: 10.1016/j.cosrev.2023.100613_b8 article-title: Non-cooperative games publication-title: Ann. of Math. doi: 10.2307/1969529 – year: 2023 ident: 10.1016/j.cosrev.2023.100613_b72 – volume: 8 start-page: 121 issue: 6 year: 2012 ident: 10.1016/j.cosrev.2023.100613_b96 article-title: The multiplicative weights update method: a meta-algorithm and applications publication-title: Theory Comput. doi: 10.4086/toc.2012.v008a006 – volume: 12 start-page: 747 year: 1976 ident: 10.1016/j.cosrev.2023.100613_b39 article-title: The extragradient method for finding saddle points and other problems publication-title: Matecon – volume: 12 start-page: 413 issue: 2 year: 1964 ident: 10.1016/j.cosrev.2023.100613_b24 article-title: Equilibrium points of bimatrix games publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0112033 – year: 1944 ident: 10.1016/j.cosrev.2023.100613_b6 – year: 2022 ident: 10.1016/j.cosrev.2023.100613_b109 article-title: Turbocharging solution concepts: Solving NEs, CEs and CCEs with neural equilibrium solvers – start-page: 1823 year: 2017 ident: 10.1016/j.cosrev.2023.100613_b44 article-title: The numerics of GANs – volume: 6 start-page: 1 issue: 1 year: 2018 ident: 10.1016/j.cosrev.2023.100613_b50 article-title: ∃r-completeness for decision versions of multi-player (symmetric) Nash equilibria publication-title: ACM Trans. Econom. Comput. doi: 10.1145/3175494 – volume: 68 start-page: 258 issue: 1 year: 1996 ident: 10.1016/j.cosrev.2023.100613_b86 article-title: Fictitious play property for games with identical interests publication-title: J. Econom. Theory doi: 10.1006/jeth.1996.0014 – volume: TR05-115 year: 2005 ident: 10.1016/j.cosrev.2023.100613_b16 article-title: The complexity of computing a Nash equilibrium publication-title: Electron. Colloq. Comput. Complex. – start-page: 4193 year: 2017 ident: 10.1016/j.cosrev.2023.100613_b30 article-title: A unified game-theoretic approach to multiagent reinforcement learning – year: 2022 ident: 10.1016/j.cosrev.2023.100613_b46 article-title: Optimistic mirror descent either converges to Nash or to strong coarse correlated equilibria in bimatrix games – start-page: 258 year: 2011 ident: 10.1016/j.cosrev.2023.100613_b37 article-title: Accelerating best response calculation in large extensive games – volume: 2 start-page: 117 issue: 2 year: 1992 ident: 10.1016/j.cosrev.2023.100613_b2 article-title: International aspects of pollution control publication-title: Environ. Resour. Econom. doi: 10.1007/BF00338239 – volume: 81 start-page: 1205 issue: 3 year: 2019 ident: 10.1016/j.cosrev.2023.100613_b36 article-title: Distributed methods for computing approximate equilibria publication-title: Algorithmica doi: 10.1007/s00453-018-0465-y – volume: 63 start-page: 139 issue: 11 year: 2020 ident: 10.1016/j.cosrev.2023.100613_b14 article-title: Generative adversarial networks publication-title: Commun. ACM doi: 10.1145/3422622 – volume: 39 start-page: 2531 issue: 6 year: 2010 ident: 10.1016/j.cosrev.2023.100613_b49 article-title: On the complexity of Nash equilibria and other fixed points publication-title: SIAM J. Comput. doi: 10.1137/080720826 – volume: 37 start-page: 319 issue: 3 year: 1987 ident: 10.1016/j.cosrev.2023.100613_b105 article-title: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices publication-title: Math. Program.: Ser. A B doi: 10.1007/BF02591741 – volume: 6 start-page: 102 issue: 2 year: 1970 ident: 10.1016/j.cosrev.2023.100613_b64 article-title: Convergence rate of the gradient descent method with dilatation of the space publication-title: Cybernetics doi: 10.1007/BF01070506 – year: 2020 ident: 10.1016/j.cosrev.2023.100613_b101 article-title: Pipeline PSRO: A scalable approach for finding approximate Nash equilibria in large games – year: 1988 ident: 10.1016/j.cosrev.2023.100613_b11 – start-page: 1695 year: 2012 ident: 10.1016/j.cosrev.2023.100613_b82 article-title: Learning in games – start-page: 536 year: 2003 ident: 10.1016/j.cosrev.2023.100613_b29 article-title: Planning in the presence of cost functions controlled by an adversary – start-page: 603 year: 2006 ident: 10.1016/j.cosrev.2023.100613_b23 article-title: Computing Nash equilibria: Approximation and smoothed complexity – start-page: 753 year: 2014 ident: 10.1016/j.cosrev.2023.100613_b106 article-title: Simple approximate equilibria in large games – volume: 1 start-page: 43 issue: 2 year: 1982 ident: 10.1016/j.cosrev.2023.100613_b66 article-title: Reminiscences about the origins of linear programming publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(82)90043-8 – volume: 53 start-page: 41 issue: 1 year: 2013 ident: 10.1016/j.cosrev.2023.100613_b90 article-title: On the rate of convergence of fictitious play publication-title: Theory Comput. Syst. doi: 10.1007/s00224-013-9460-5 – year: 2018 ident: 10.1016/j.cosrev.2023.100613_b40 article-title: Training GANs with optimism – volume: 19 issue: 4 year: 2023 ident: 10.1016/j.cosrev.2023.100613_b35 article-title: A polynomial-time algorithm for 1/3-Approximate Nash equilibria in bimatrix games publication-title: ACM Trans. Algorithms doi: 10.1145/3606697 – volume: vol. 202 start-page: 8747 year: 2023 ident: 10.1016/j.cosrev.2023.100613_b110 article-title: Are equivariant equilibrium approximators beneficial? – volume: 48 start-page: 498 issue: 3 year: 1994 ident: 10.1016/j.cosrev.2023.100613_b15 article-title: On the complexity of the parity argument and other inefficient proofs of existence publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(05)80063-7 – volume: vol. 9125 start-page: 339 year: 2015 ident: 10.1016/j.cosrev.2023.100613_b26 article-title: An empirical study of finding approximate equilibria in bimatrix games |
| SSID | ssj0070056 |
| Score | 2.427513 |
| SecondaryResourceType | review_article |
| Snippet | Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 100613 |
| SubjectTerms | Approximation algorithms Game theory Nash equilibrium |
| Title | A survey on algorithms for Nash equilibria in finite normal-form games |
| URI | https://dx.doi.org/10.1016/j.cosrev.2023.100613 |
| Volume | 51 |
| WOSCitedRecordID | wos001165834700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1876-7745 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0070056 issn: 1574-0137 databaseCode: AIEXJ dateStart: 20070801 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELZQlwMX3ojlJR-4RUZN7CTusYJdAYIVEououESJY7epKne3aVb785mJ7abLIl4Sl6iy4jqa-Tr57M58Q8jLysRlnSnJSriDCXgDsErzjPE6qWsxroAji77ZRH5yImezySefP9_27QRya-Xl5eTsv7oaxsDZWDr7F-7efSkMwGdwOlzB7XD9I8dPo7bbXMBPHfOMV_M17P4XTnUBQmm7iPR51_SJ_iWedZgGSWdkkbquGDLYaF6GqpCgYOA7P0ShBmhz5Q-FD67xNUSVbgCJP4b-qu1iwN-bzh23fls0yz1Yfpx3ttkl2Ed93cT-aUQiQgJzOCILZTJXsjjjNMdUF6fu8kq7MQjDQO2dlmQIxU579lpUdwcMS3BKi415sOM7Zndkror1B73sz7gaLgabK-TDsDU-SPJ0IkfkYPruaPY-vKhzlEHt5XT904XKyj797_paP2cue2zk9C657bcRdOrcf4_c0PY-uRMcRX3EfkCOp9Shga4tHdBAwdEU0UAHNNDGUocGuocG2qPhIflyfHT6-i3zrTOYgj3glomkkrKMDed1qoDklULoUudZptO8FioB4meEKMcq41xVOsmMBh4dGylMGUsl-SMysmurHxMKtpwII6qkMpWoUBogT1EjaSwEV7yODwkPZimU15XH9iarIiQQLgtnzAKNWThjHhK2m3XmdFV-c38eLF54sDvOVwBIfjnzyT_PfEpuDRB_RkbbTaefk5vqYtu0mxceTd8Bk5-KEQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+survey+on+algorithms+for+Nash+equilibria+in+finite+normal-form+games&rft.jtitle=Computer+science+review&rft.au=Li%2C+Hanyu&rft.au=Huang%2C+Wenhan&rft.au=Duan%2C+Zhijian&rft.au=Mguni%2C+David+Henry&rft.date=2024-02-01&rft.pub=Elsevier+Inc&rft.issn=1574-0137&rft.eissn=1876-7745&rft.volume=51&rft_id=info:doi/10.1016%2Fj.cosrev.2023.100613&rft.externalDocID=S1574013723000801 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1574-0137&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1574-0137&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1574-0137&client=summon |