2021
DOI: 10.3934/math.2021081
|View full text |Cite
|
Sign up to set email alerts
|

Differential evolution particle swarm optimization algorithm based on good point set for computing Nash equilibrium of finite noncooperative game

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…To achieve better performance (convergence speed, accuracy, and global optimization ability) compared to individual methods, several hybrid approaches appear in the literature, including DE and PSO ( Hendtlass, 2001 ; Zhang and Xie, 2003 ; Talbi and Batouche, 2004 ; Hao et al, 2007 ; Das et al, 2008 ; Vaisakh et al, 2009 ; Garcia-Guarin et al, 2019 ; Dash et al, 2020 ; Li et al, 2021 ), PSO and GA ( Mousa et al, 2012 ; Esmin and Matwin, 2013 ; Samuel and Rajan, 2015 ; Ali and Tawhid, 2017 ; Dziwiński and Bartczuk, 2019 ; Pu et al, 2019 ; Omidinasab and Goodarzimehr, 2020 ; Fu et al, 2021 ; Goodarzimehr et al, 2023 ), and GA and DE ( Trivedi et al, 2015 , 2016 ; Abidin, 2018 ; Aguitoni et al, 2018 ; Chaudhary et al, 2019 ; Fathy et al, 2020 ) ( Fig. 9 ).…”
Section: Numerical Solution and Calibrationmentioning
confidence: 99%
“…To achieve better performance (convergence speed, accuracy, and global optimization ability) compared to individual methods, several hybrid approaches appear in the literature, including DE and PSO ( Hendtlass, 2001 ; Zhang and Xie, 2003 ; Talbi and Batouche, 2004 ; Hao et al, 2007 ; Das et al, 2008 ; Vaisakh et al, 2009 ; Garcia-Guarin et al, 2019 ; Dash et al, 2020 ; Li et al, 2021 ), PSO and GA ( Mousa et al, 2012 ; Esmin and Matwin, 2013 ; Samuel and Rajan, 2015 ; Ali and Tawhid, 2017 ; Dziwiński and Bartczuk, 2019 ; Pu et al, 2019 ; Omidinasab and Goodarzimehr, 2020 ; Fu et al, 2021 ; Goodarzimehr et al, 2023 ), and GA and DE ( Trivedi et al, 2015 , 2016 ; Abidin, 2018 ; Aguitoni et al, 2018 ; Chaudhary et al, 2019 ; Fathy et al, 2020 ) ( Fig. 9 ).…”
Section: Numerical Solution and Calibrationmentioning
confidence: 99%
“…The generation of new solutions in the CS algorithm is primarily based on the information difference between individuals and their peers, leading to slow convergence in the later stages of the algorithm and a decrease in optimization accuracy. Information sharing among cuckoo individuals helps alleviate this problem, and previous research [34][35][36][37] has attempted to use information sharing to improve the performance of the CS algorithm, resulting in some new and improved CS algorithms. In order to further strengthen the information sharing among cuckoo individuals, an improved CS based on shared mechanism (ICSABOSM) is proposed, enhancing the collaboration within the population.…”
Section: Improved Cuckoo Search Algorithmmentioning
confidence: 99%
“…Theorem 2.2. [20] A mixed strategy x * ∈ X is the Nash equilibrium point of a game Γ if and only if x * is an optimal solution to the following optimization problem, and the optimal value is 0:…”
Section: Conclusion 21mentioning
confidence: 99%
“…It means that such algorithms can be considered to solve the Nash equilibria. Pavlidis [25], Boryczka [3], Jia [15], Yang [30], and Li [20] used intelligent algorithms to compute the Nash equilibria of corresponding games. But, most of them dealt with zero sum two-person games or nonzero sum two-person games.…”
Section: Introductionmentioning
confidence: 99%