A fast optimization approach for seeking Nash equilibrium based on Nikaido–Isoda function, state transition algorithm and Gauss–Seidel technique
This paper proposes a fast optimization approach for non-cooperative games with complicated payoff functions (non-smooth, non-concave, etc.). The Nikaido–Isoda function is employed to convert knotty Nash equilibrium problems (NEPs) into large-scale optimization problems with complex objective functi...
Gespeichert in:
| Veröffentlicht in: | Neurocomputing (Amsterdam) Jg. 616; S. 128922 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.02.2025
|
| Schlagworte: | |
| ISSN: | 0925-2312 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper proposes a fast optimization approach for non-cooperative games with complicated payoff functions (non-smooth, non-concave, etc.). The Nikaido–Isoda function is employed to convert knotty Nash equilibrium problems (NEPs) into large-scale optimization problems with complex objective functions. To efficiently seek Nash equilibrium, the resulting optimization problems are decomposed into many subproblems where each player tries to maximize its payoff when observing others’ current strategies. All players’ strategies are updated iteratively until reaching Nash equilibrium. Specifically, a dynamic state transition algorithm (STA) is proposed to seek global optima of subproblems at each iteration, and the sequential quadratic programming (SQP) is embedded into dynamic STA for convergence acceleration. A Gauss–Seidel technique is utilized for players’ strategy updates to improve computational efficiency further. Numerical examples drawn from multidisciplinary contexts validate that the proposed approach could effectively seek out Nash equilibrium for simultaneously decreasing the time-consuming remarkably. |
|---|---|
| AbstractList | This paper proposes a fast optimization approach for non-cooperative games with complicated payoff functions (non-smooth, non-concave, etc.). The Nikaido–Isoda function is employed to convert knotty Nash equilibrium problems (NEPs) into large-scale optimization problems with complex objective functions. To efficiently seek Nash equilibrium, the resulting optimization problems are decomposed into many subproblems where each player tries to maximize its payoff when observing others’ current strategies. All players’ strategies are updated iteratively until reaching Nash equilibrium. Specifically, a dynamic state transition algorithm (STA) is proposed to seek global optima of subproblems at each iteration, and the sequential quadratic programming (SQP) is embedded into dynamic STA for convergence acceleration. A Gauss–Seidel technique is utilized for players’ strategy updates to improve computational efficiency further. Numerical examples drawn from multidisciplinary contexts validate that the proposed approach could effectively seek out Nash equilibrium for simultaneously decreasing the time-consuming remarkably. |
| ArticleNumber | 128922 |
| Author | Huang, Tingwen Zhou, Xiaojun Wang, Zheng |
| Author_xml | – sequence: 1 givenname: Xiaojun surname: Zhou fullname: Zhou, Xiaojun organization: School of Automation, Central South University, Changsha 410083, PR China – sequence: 2 givenname: Zheng surname: Wang fullname: Wang, Zheng email: wangzheng@nrec.com organization: School of Automation, Central South University, Changsha 410083, PR China – sequence: 3 givenname: Tingwen surname: Huang fullname: Huang, Tingwen organization: Texas A&M University at Qatar, Doha 23874, Qatar |
| BookMark | eNp9kM1OGzEURr0ACZLyBiz8ACT4Z2aS2SChiAISoovC2rpjX5MbMnZieyqVFe_QPmGfpImm667u5p6jT2fCTkIMyNilFHMpZHO9mQccbOznSqhqLtWyVeqEnYtW1TOlpTpjk5w3QsiFVO05-33LPeTC465QTx9QKAYOu12KYNfcx8Qz4juFN_4Mec1xP9CWukRDzzvI6Pjh_ZnegVz88_nrMUcH3A_BHj1XPBcoyEuCkGk0b99iorLuOQTH72HI-YB9R3K45QXtOtB-wC_s1MM248W_O2WvX-9eVg-zp2_3j6vbp5lVdV1mVaO19k5p36EVi4UVjZC-WXqvu7q1lQCtHEDTKe-6pW6xVlVbO9ssdScaqfSUVaPXpphzQm92iXpIP40U5ljTbMxY0xxrmrHmAbsZMTxs-0GYTLaEwaKjhLYYF-n_gr-lv4li |
| Cites_doi | 10.1109/TEVC.2004.832862 10.1016/0304-4068(90)90005-T 10.1016/S0191-2615(98)00009-5 10.1109/TAC.2011.2173412 10.1109/TCYB.2018.2850350 10.1016/j.knosys.2022.108119 10.1016/j.neucom.2019.05.076 10.1109/TII.2017.2739339 10.1109/ACCESS.2018.2847641 10.3934/jimo.2012.8.1039 10.1080/10556789908805766 10.1109/TPWRS.2004.835663 10.1016/j.neucom.2017.04.027 10.1017/S0962492900002518 10.1016/S1574-0005(05)80011-6 10.1016/j.asoc.2011.08.056 10.1109/ACCESS.2017.2768068 10.1371/journal.pone.0161634 10.1016/j.neucom.2017.08.010 10.1016/j.automatica.2021.109794 10.3390/math10010081 10.1109/TII.2019.2943500 10.1137/18M1231298 10.1007/BF01585096 10.1016/j.neucom.2007.12.007 10.1016/j.neucom.2019.01.009 10.1109/59.962436 10.1016/j.neucom.2015.08.041 10.1109/TAC.2016.2526598 10.1109/TSG.2016.2521377 10.1016/j.neucom.2021.05.053 10.1109/TAC.2015.2414817 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier B.V. |
| Copyright_xml | – notice: 2024 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.neucom.2024.128922 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_neucom_2024_128922 S092523122401693X |
| GroupedDBID | --- --K --M .DC .~1 0R~ 123 1B1 1~. 1~5 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9JM 9JN AABNK AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAXKI AAXLA AAXUO AAYFN ABBOA ABCQJ ABFNM ABJNI ABMAC ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFJKZ AFKWA AFTJW AFXIZ AGHFR AGUBO AGWIK AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W KOM MO0 MOBAO N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSN SSV SSZ T5K ZMT ~G- 29N 9DU AAQXK AATTM AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FEDTE FGOYB HLZ HVGLF HZ~ LG9 M41 R2- SBC WUQ XPP ~HD |
| ID | FETCH-LOGICAL-c255t-46333fd23fbec077c0601f68ff3b59c40a32daa6b2fdb839e52495dc683b06123 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001453149600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-2312 |
| IngestDate | Sat Nov 29 06:34:02 EST 2025 Sat Dec 14 16:14:39 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Gauss–Seidel technique Non-cooperative game Nash equilibrium State transition algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c255t-46333fd23fbec077c0601f68ff3b59c40a32daa6b2fdb839e52495dc683b06123 |
| ParticipantIDs | crossref_primary_10_1016_j_neucom_2024_128922 elsevier_sciencedirect_doi_10_1016_j_neucom_2024_128922 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-02-01 2025-02-00 |
| PublicationDateYYYYMMDD | 2025-02-01 |
| PublicationDate_xml | – month: 02 year: 2025 text: 2025-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Neurocomputing (Amsterdam) |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – sequence: 0 name: Elsevier B.V |
| References | Zhou, Yang, Gui (b22) 2012; 8 Wilson (b13) 1992; Vol. 1 He, Zhang, Zhang (b17) 2016; 11 Zhou, Tian, Long, Jin, Yu, Yang (b24) 2021; 455 Ye, Hu (b4) 2015; 60 Zubieta (b2) 1998; 32 Zhou, Zhou, Yang, Gui (b28) 2018; 6 Su (b34) 2004 Yang, Deng, Li, Zhu, Li (b27) 2017; 5 Sturm (b35) 1999; 11 Zhou, Shi, Lim, Yang, Gui (b29) 2018; 273 Nekouei, Nair, Alpcan (b10) 2016; 61 Li, Yu, Yu, Chen, Wang (b19) 2017; 8 Nikaidô, Isoda (b18) 1955 Koh (b16) 2012; 12 Park, Kim, Kim, Jung, Park (b12) 2001; 16 Zhou, Tian, Wang, Yang, Huang, Xu (b30) 2022; 240 Zhang, Fan (b9) 2008; 72 Son, Baldick (b14) 2004; 8 Shi, Yang (b7) 2019; 359 Deng (b39) 2021; 132 Maiorano, Song, Trovato (b38) 2000; Vol. 2 Lin, Zhou, Li, Huang, Yang (b23) 2022 Mazumdar, Ratliff, Sastry (b11) 2020; 2 Boggs, Tolle (b33) 1995; 4 Harnpornchai, Wonggattaleekam (b15) 2021; 10 Gountis, Bakirtzis (b6) 2004; 19 Zhou, Gao, Yang, Gui (b25) 2016; 173 Murphy, Sherali, Soyster (b37) 1982; 24 Poveda, Krstić, Başar (b5) 2020 Zhou, Huang, Huang, Yang, Gui (b26) 2019; 16 Zhou, Yang, Gui (b32) 2019; 49 Li, Xu, Yu, Ryan, Huang (b36) 2017; 13 Frihauf, Krstic, Basar (b3) 2011; 57 Vives (b21) 1990; 19 Dai, Gao, Gao, Zhu (b1) 2017; 260 Kampezidou, Romberg, Vamvoudakis, Mavris (b20) 2023 Zhou, Yang, Xie, Yang, Huang (b31) 2019; 334 Facchinei, Pang (b8) 2003 Koh (10.1016/j.neucom.2024.128922_b16) 2012; 12 Park (10.1016/j.neucom.2024.128922_b12) 2001; 16 Su (10.1016/j.neucom.2024.128922_b34) 2004 He (10.1016/j.neucom.2024.128922_b17) 2016; 11 Shi (10.1016/j.neucom.2024.128922_b7) 2019; 359 Zhou (10.1016/j.neucom.2024.128922_b30) 2022; 240 Vives (10.1016/j.neucom.2024.128922_b21) 1990; 19 Maiorano (10.1016/j.neucom.2024.128922_b38) 2000; Vol. 2 Zubieta (10.1016/j.neucom.2024.128922_b2) 1998; 32 Son (10.1016/j.neucom.2024.128922_b14) 2004; 8 Zhou (10.1016/j.neucom.2024.128922_b32) 2019; 49 Mazumdar (10.1016/j.neucom.2024.128922_b11) 2020; 2 Nikaidô (10.1016/j.neucom.2024.128922_b18) 1955 Lin (10.1016/j.neucom.2024.128922_b23) 2022 Murphy (10.1016/j.neucom.2024.128922_b37) 1982; 24 Wilson (10.1016/j.neucom.2024.128922_b13) 1992; Vol. 1 Zhang (10.1016/j.neucom.2024.128922_b9) 2008; 72 Zhou (10.1016/j.neucom.2024.128922_b28) 2018; 6 Nekouei (10.1016/j.neucom.2024.128922_b10) 2016; 61 Zhou (10.1016/j.neucom.2024.128922_b31) 2019; 334 Zhou (10.1016/j.neucom.2024.128922_b22) 2012; 8 Zhou (10.1016/j.neucom.2024.128922_b26) 2019; 16 Frihauf (10.1016/j.neucom.2024.128922_b3) 2011; 57 Ye (10.1016/j.neucom.2024.128922_b4) 2015; 60 Deng (10.1016/j.neucom.2024.128922_b39) 2021; 132 Yang (10.1016/j.neucom.2024.128922_b27) 2017; 5 Boggs (10.1016/j.neucom.2024.128922_b33) 1995; 4 Li (10.1016/j.neucom.2024.128922_b36) 2017; 13 Zhou (10.1016/j.neucom.2024.128922_b29) 2018; 273 Dai (10.1016/j.neucom.2024.128922_b1) 2017; 260 Facchinei (10.1016/j.neucom.2024.128922_b8) 2003 Kampezidou (10.1016/j.neucom.2024.128922_b20) 2023 Sturm (10.1016/j.neucom.2024.128922_b35) 1999; 11 Poveda (10.1016/j.neucom.2024.128922_b5) 2020 Gountis (10.1016/j.neucom.2024.128922_b6) 2004; 19 Zhou (10.1016/j.neucom.2024.128922_b25) 2016; 173 Harnpornchai (10.1016/j.neucom.2024.128922_b15) 2021; 10 Zhou (10.1016/j.neucom.2024.128922_b24) 2021; 455 Li (10.1016/j.neucom.2024.128922_b19) 2017; 8 |
| References_xml | – volume: 32 start-page: 413 year: 1998 end-page: 422 ident: b2 article-title: A network equilibrium model for oligopolistic competition in city bus services publication-title: Transp. Res. B – volume: 12 start-page: 161 year: 2012 end-page: 173 ident: b16 article-title: An evolutionary algorithm based on Nash dominance for equilibrium problems with equilibrium constraints publication-title: Appl. Soft Comput. – volume: 8 start-page: 250 year: 2017 end-page: 261 ident: b19 article-title: Efficient computation for sparse load shifting in demand side management publication-title: IEEE Trans. Smart Grid – volume: 173 start-page: 864 year: 2016 end-page: 874 ident: b25 article-title: Discrete state transition algorithm for unconstrained integer optimization problems publication-title: Neurocomputing – year: 2004 ident: b34 article-title: A Sequential NCP Algorithm for Solving Equilibrium Problems with Equilibrium Constraints – volume: 11 start-page: 625 year: 1999 end-page: 653 ident: b35 article-title: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones publication-title: Optim. Methods Softw. – volume: 8 start-page: 1039 year: 2012 ident: b22 article-title: State transition algorithm publication-title: J. Ind. Manag. Optim. – volume: 13 start-page: 2620 year: 2017 end-page: 2630 ident: b36 article-title: Risk-averse energy trading in multienergy microgrids: A two-stage stochastic game approach publication-title: IEEE Trans. Ind. Inform. – volume: 132 year: 2021 ident: b39 article-title: Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games publication-title: Automatica – year: 2003 ident: b8 article-title: Finite-Dimensional Variational Inequalities and Complementarity Problems – volume: 334 start-page: 89 year: 2019 end-page: 99 ident: b31 article-title: A novel modularity-based discrete state transition algorithm for community detection in networks publication-title: Neurocomputing – volume: 61 start-page: 3771 year: 2016 end-page: 3783 ident: b10 article-title: Performance analysis of gradient-based nash seeking algorithms under quantization publication-title: IEEE Trans. Autom. Control – volume: 16 start-page: 7255 year: 2019 end-page: 7263 ident: b26 article-title: Dynamic optimization for copper removal process with continuous production constraints publication-title: IEEE Trans. Ind. Inform. – volume: 57 start-page: 1192 year: 2011 end-page: 1207 ident: b3 article-title: Nash equilibrium seeking in noncooperative games publication-title: IEEE Trans. Autom. Control – start-page: 3514 year: 2020 end-page: 3519 ident: b5 article-title: Fixed-time Nash equilibrium seeking in non-cooperative games publication-title: 2020 59th IEEE Conference on Decision and Control – year: 2023 ident: b20 article-title: Scalable online learning of approximate Stackelberg solutions in energy trading games with demand response aggregators – volume: 19 start-page: 305 year: 1990 end-page: 321 ident: b21 article-title: Nash equilibrium with strategic complementarities publication-title: J. Math. Econom. – volume: 260 start-page: 149 year: 2017 end-page: 156 ident: b1 article-title: Real-time pricing scheme based on Stackelberg game in smart grid with multiple power retailers publication-title: Neurocomputing – start-page: 1 year: 2022 end-page: 10 ident: b23 article-title: Data-driven state transition algorithm for fuzzy chance-constrained dynamic optimization publication-title: IEEE Trans. Neural Netw. Learn. Syst. – volume: 2 start-page: 103 year: 2020 end-page: 131 ident: b11 article-title: On gradient-based learning in continuous games publication-title: SIAM J. Math. Data Sci. – volume: 8 start-page: 305 year: 2004 end-page: 315 ident: b14 article-title: Hybrid coevolutionary programming for Nash equilibrium search in games with local optima publication-title: IEEE Trans. Evol. Comput. – volume: 5 start-page: 24688 year: 2017 end-page: 24697 ident: b27 article-title: Optimal control for zinc electrowinning process with current switching publication-title: IEEE Access – volume: 19 start-page: 1837 year: 2004 end-page: 1844 ident: b6 article-title: Efficient determination of Cournot equilibria in electricity markets publication-title: IEEE Trans. Power Syst. – volume: 240 year: 2022 ident: b30 article-title: Nonlinear bilevel programming approach for decentralized supply chain using a hybrid state transition algorithm publication-title: Knowl.-Based Syst. – volume: 4 start-page: 1 year: 1995 end-page: 51 ident: b33 article-title: Sequential quadratic programming publication-title: Acta Numer. – volume: Vol. 1 start-page: 227 year: 1992 end-page: 279 ident: b13 article-title: Strategic analysis of auctions publication-title: Handbook of Game Theory with Economic Applications – volume: 49 start-page: 3722 year: 2019 end-page: 3730 ident: b32 article-title: A statistical study on parameter selection of operators in continuous state transition algorithm publication-title: IEEE Trans. Cybern. – volume: 60 start-page: 3000 year: 2015 end-page: 3005 ident: b4 article-title: Distributed seeking of time-varying Nash equilibrium for non-cooperative games publication-title: IEEE Trans. Autom. Control – volume: Vol. 2 start-page: 838 year: 2000 end-page: 844 ident: b38 article-title: Dynamics of non-collusive oligopolistic electricity markets publication-title: 2000 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No. 00CH37077) – volume: 16 start-page: 847 year: 2001 end-page: 855 ident: b12 article-title: A continuous strategy game for power transactions analysis in competitive electricity markets publication-title: IEEE Trans. Power Syst. – volume: 10 start-page: 81 year: 2021 ident: b15 article-title: A Nikaido Isoda-based hybrid genetic algorithm and relaxation method for finding Nash equilibrium publication-title: Mathematics – volume: 6 start-page: 36683 year: 2018 end-page: 36698 ident: b28 article-title: Set-point tracking and multi-objective optimization-based PID control for the goethite process publication-title: IEEE Access – volume: 273 start-page: 237 year: 2018 end-page: 250 ident: b29 article-title: A dynamic state transition algorithm with application to sensor network localization publication-title: Neurocomputing – year: 1955 ident: b18 article-title: Note on non-cooperative convex games – volume: 455 start-page: 202 year: 2021 end-page: 214 ident: b24 article-title: A fast constrained state transition algorithm publication-title: Neurocomputing – volume: 359 start-page: 114 year: 2019 end-page: 121 ident: b7 article-title: Nash equilibrium computation in two-network zero-sum games: An incremental algorithm publication-title: Neurocomputing – volume: 11 year: 2016 ident: b17 article-title: A differential evolution algorithm based on Nikaido-Isoda function for solving Nash equilibrium in nonlinear continuous games publication-title: Plos One – volume: 24 start-page: 92 year: 1982 end-page: 106 ident: b37 article-title: A mathematical programming approach for determining oligopolistic market equilibrium publication-title: Math. Program. – volume: 72 start-page: 533 year: 2008 end-page: 538 ident: b9 article-title: An adaptive policy gradient in learning Nash equilibria publication-title: Neurocomputing – volume: 8 start-page: 305 issue: 4 year: 2004 ident: 10.1016/j.neucom.2024.128922_b14 article-title: Hybrid coevolutionary programming for Nash equilibrium search in games with local optima publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2004.832862 – volume: 19 start-page: 305 issue: 3 year: 1990 ident: 10.1016/j.neucom.2024.128922_b21 article-title: Nash equilibrium with strategic complementarities publication-title: J. Math. Econom. doi: 10.1016/0304-4068(90)90005-T – year: 2023 ident: 10.1016/j.neucom.2024.128922_b20 – volume: 32 start-page: 413 issue: 6 year: 1998 ident: 10.1016/j.neucom.2024.128922_b2 article-title: A network equilibrium model for oligopolistic competition in city bus services publication-title: Transp. Res. B doi: 10.1016/S0191-2615(98)00009-5 – volume: 57 start-page: 1192 issue: 5 year: 2011 ident: 10.1016/j.neucom.2024.128922_b3 article-title: Nash equilibrium seeking in noncooperative games publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2011.2173412 – volume: 49 start-page: 3722 issue: 10 year: 2019 ident: 10.1016/j.neucom.2024.128922_b32 article-title: A statistical study on parameter selection of operators in continuous state transition algorithm publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2018.2850350 – volume: Vol. 2 start-page: 838 year: 2000 ident: 10.1016/j.neucom.2024.128922_b38 article-title: Dynamics of non-collusive oligopolistic electricity markets – volume: 240 year: 2022 ident: 10.1016/j.neucom.2024.128922_b30 article-title: Nonlinear bilevel programming approach for decentralized supply chain using a hybrid state transition algorithm publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2022.108119 – volume: 359 start-page: 114 year: 2019 ident: 10.1016/j.neucom.2024.128922_b7 article-title: Nash equilibrium computation in two-network zero-sum games: An incremental algorithm publication-title: Neurocomputing doi: 10.1016/j.neucom.2019.05.076 – volume: 13 start-page: 2620 issue: 5 year: 2017 ident: 10.1016/j.neucom.2024.128922_b36 article-title: Risk-averse energy trading in multienergy microgrids: A two-stage stochastic game approach publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2017.2739339 – volume: 6 start-page: 36683 year: 2018 ident: 10.1016/j.neucom.2024.128922_b28 article-title: Set-point tracking and multi-objective optimization-based PID control for the goethite process publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2847641 – volume: 8 start-page: 1039 issue: 4 year: 2012 ident: 10.1016/j.neucom.2024.128922_b22 article-title: State transition algorithm publication-title: J. Ind. Manag. Optim. doi: 10.3934/jimo.2012.8.1039 – volume: 11 start-page: 625 issue: 1–4 year: 1999 ident: 10.1016/j.neucom.2024.128922_b35 article-title: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones publication-title: Optim. Methods Softw. doi: 10.1080/10556789908805766 – volume: 19 start-page: 1837 issue: 4 year: 2004 ident: 10.1016/j.neucom.2024.128922_b6 article-title: Efficient determination of Cournot equilibria in electricity markets publication-title: IEEE Trans. Power Syst. doi: 10.1109/TPWRS.2004.835663 – volume: 260 start-page: 149 year: 2017 ident: 10.1016/j.neucom.2024.128922_b1 article-title: Real-time pricing scheme based on Stackelberg game in smart grid with multiple power retailers publication-title: Neurocomputing doi: 10.1016/j.neucom.2017.04.027 – volume: 4 start-page: 1 year: 1995 ident: 10.1016/j.neucom.2024.128922_b33 article-title: Sequential quadratic programming publication-title: Acta Numer. doi: 10.1017/S0962492900002518 – volume: Vol. 1 start-page: 227 year: 1992 ident: 10.1016/j.neucom.2024.128922_b13 article-title: Strategic analysis of auctions doi: 10.1016/S1574-0005(05)80011-6 – volume: 12 start-page: 161 issue: 1 year: 2012 ident: 10.1016/j.neucom.2024.128922_b16 article-title: An evolutionary algorithm based on Nash dominance for equilibrium problems with equilibrium constraints publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.08.056 – volume: 5 start-page: 24688 year: 2017 ident: 10.1016/j.neucom.2024.128922_b27 article-title: Optimal control for zinc electrowinning process with current switching publication-title: IEEE Access doi: 10.1109/ACCESS.2017.2768068 – volume: 11 issue: 9 year: 2016 ident: 10.1016/j.neucom.2024.128922_b17 article-title: A differential evolution algorithm based on Nikaido-Isoda function for solving Nash equilibrium in nonlinear continuous games publication-title: Plos One doi: 10.1371/journal.pone.0161634 – volume: 273 start-page: 237 year: 2018 ident: 10.1016/j.neucom.2024.128922_b29 article-title: A dynamic state transition algorithm with application to sensor network localization publication-title: Neurocomputing doi: 10.1016/j.neucom.2017.08.010 – year: 2004 ident: 10.1016/j.neucom.2024.128922_b34 – volume: 132 year: 2021 ident: 10.1016/j.neucom.2024.128922_b39 article-title: Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games publication-title: Automatica doi: 10.1016/j.automatica.2021.109794 – volume: 10 start-page: 81 issue: 1 year: 2021 ident: 10.1016/j.neucom.2024.128922_b15 article-title: A Nikaido Isoda-based hybrid genetic algorithm and relaxation method for finding Nash equilibrium publication-title: Mathematics doi: 10.3390/math10010081 – volume: 16 start-page: 7255 issue: 12 year: 2019 ident: 10.1016/j.neucom.2024.128922_b26 article-title: Dynamic optimization for copper removal process with continuous production constraints publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2019.2943500 – volume: 2 start-page: 103 issue: 1 year: 2020 ident: 10.1016/j.neucom.2024.128922_b11 article-title: On gradient-based learning in continuous games publication-title: SIAM J. Math. Data Sci. doi: 10.1137/18M1231298 – volume: 24 start-page: 92 issue: 1 year: 1982 ident: 10.1016/j.neucom.2024.128922_b37 article-title: A mathematical programming approach for determining oligopolistic market equilibrium publication-title: Math. Program. doi: 10.1007/BF01585096 – volume: 72 start-page: 533 issue: 1–3 year: 2008 ident: 10.1016/j.neucom.2024.128922_b9 article-title: An adaptive policy gradient in learning Nash equilibria publication-title: Neurocomputing doi: 10.1016/j.neucom.2007.12.007 – volume: 334 start-page: 89 year: 2019 ident: 10.1016/j.neucom.2024.128922_b31 article-title: A novel modularity-based discrete state transition algorithm for community detection in networks publication-title: Neurocomputing doi: 10.1016/j.neucom.2019.01.009 – start-page: 3514 year: 2020 ident: 10.1016/j.neucom.2024.128922_b5 article-title: Fixed-time Nash equilibrium seeking in non-cooperative games – volume: 16 start-page: 847 issue: 4 year: 2001 ident: 10.1016/j.neucom.2024.128922_b12 article-title: A continuous strategy game for power transactions analysis in competitive electricity markets publication-title: IEEE Trans. Power Syst. doi: 10.1109/59.962436 – year: 1955 ident: 10.1016/j.neucom.2024.128922_b18 – volume: 173 start-page: 864 year: 2016 ident: 10.1016/j.neucom.2024.128922_b25 article-title: Discrete state transition algorithm for unconstrained integer optimization problems publication-title: Neurocomputing doi: 10.1016/j.neucom.2015.08.041 – volume: 61 start-page: 3771 issue: 12 year: 2016 ident: 10.1016/j.neucom.2024.128922_b10 article-title: Performance analysis of gradient-based nash seeking algorithms under quantization publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2016.2526598 – volume: 8 start-page: 250 issue: 1 year: 2017 ident: 10.1016/j.neucom.2024.128922_b19 article-title: Efficient computation for sparse load shifting in demand side management publication-title: IEEE Trans. Smart Grid doi: 10.1109/TSG.2016.2521377 – start-page: 1 year: 2022 ident: 10.1016/j.neucom.2024.128922_b23 article-title: Data-driven state transition algorithm for fuzzy chance-constrained dynamic optimization publication-title: IEEE Trans. Neural Netw. Learn. Syst. – volume: 455 start-page: 202 year: 2021 ident: 10.1016/j.neucom.2024.128922_b24 article-title: A fast constrained state transition algorithm publication-title: Neurocomputing doi: 10.1016/j.neucom.2021.05.053 – volume: 60 start-page: 3000 issue: 11 year: 2015 ident: 10.1016/j.neucom.2024.128922_b4 article-title: Distributed seeking of time-varying Nash equilibrium for non-cooperative games publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2015.2414817 – year: 2003 ident: 10.1016/j.neucom.2024.128922_b8 |
| SSID | ssj0017129 |
| Score | 2.4344025 |
| Snippet | This paper proposes a fast optimization approach for non-cooperative games with complicated payoff functions (non-smooth, non-concave, etc.). The Nikaido–Isoda... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 128922 |
| SubjectTerms | Gauss–Seidel technique Nash equilibrium Non-cooperative game State transition algorithm |
| Title | A fast optimization approach for seeking Nash equilibrium based on Nikaido–Isoda function, state transition algorithm and Gauss–Seidel technique |
| URI | https://dx.doi.org/10.1016/j.neucom.2024.128922 |
| Volume | 616 |
| WOSCitedRecordID | wos001453149600001&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 issn: 0925-2312 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0017129 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ1Lb9NAEIBXoeXAhTeivLQHbsaV4_VrjxYqUA4REkFEvVjrXZs4NHaJ7dIj_wF-CL-JX8Lsy3EpquiBixWt7LWV-TQzHs8DoecMOBA8oW4kSgIvKDR38ymJXV_4Ypp4URIQoYZNxLNZsljQd5PJT1sLc3oc13VydkZP_quoYQ2ELUtnryDuYVNYgN8gdDiC2OH4T4JPnZK1ndOALlibIsuhc7hKKmyLQsbHQbG2S6f40lcq7b9fO9KiCfn1YFZ9ZpVobCIEOWwbwRxpAlUqCEhF1SHJ-RK1zvly2PGnZlN1Sz1x4zXr23a4_L3qpeUM7WLHDrFqDsLVaAkTtEjXsneDkKAOQYqjZdPL2y4q1qz6geePJth9tCyMAVaAmtU5bPjVVLqZuIYf2lTobYAS1sD7PKero-lY24Jtpbqq-YIh0DGJ1X5d9DIrCG4Q7G9PP993-w97OGQp2gS4VaZ3yeQumd7lGtr145CCKdhNDw8Wb4cvV_HU1_0dzdPbck2VU3jxaf7uDo1cnPltdNO8m-BUM3UHTYr6Lrpl535gYwbuoR8plojhMWLYIoYBMWwQwxIxPEIMK8QwnG4Q-_Xtu4ILW7heYIUW3qKFB7QwoIUVWnCZhgoPUN1HH14dzF--cc10D5fDa2znBhEhpBQ-KUGNeHHMZWegMkrKkuQh5YHHiC8Yi3K_FDm48UUox6QLHiUkV02DHqCduqmLhwjTMJBTFcBgeklQUg4KJhdceKCgPJr4fA-59k_OTnQTl-wy4e6h2EoiM46odjAzwOvSKx9d8U6P0Y0t-0_QTrfpi6foOj_tqnbzzLD1G7_5sTs |
| 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+fast+optimization+approach+for+seeking+Nash+equilibrium+based+on+Nikaido%E2%80%93Isoda+function%2C+state+transition+algorithm+and+Gauss%E2%80%93Seidel+technique&rft.jtitle=Neurocomputing+%28Amsterdam%29&rft.au=Zhou%2C+Xiaojun&rft.au=Wang%2C+Zheng&rft.au=Huang%2C+Tingwen&rft.date=2025-02-01&rft.issn=0925-2312&rft.volume=616&rft.spage=128922&rft_id=info:doi/10.1016%2Fj.neucom.2024.128922&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_neucom_2024_128922 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-2312&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-2312&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-2312&client=summon |