Stimulating trust cooperation in edge services: An evolutionary tripartite game

Sun, Panjun; Shen, Shigen; Wu, Zongda; Zhou, Haiping; Gao, Xiaozhi

doi:10.1016/j.engappai.2022.105465

Cited by 14 publications

(2 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Real-world optimization problems usually can be described as mathematical models of unconstrained functions or constrained functions [32][33][34]. In this section, we first propose a spider monkey algorithm named SMO 3 that combines opposition-based learning (OBL) and orthogonal experimental design (OED) for unconstrained optimization problems.…”

Section: Spider Monkey Algorithm For Unconstrained Optimizationmentioning

confidence: 99%

A Spider Monkey Optimization Algorithm Combining Opposition-Based Learning and Orthogonal Experimental Design

Liao,

Xia,

Jia

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

As a new bionic algorithm, Spider Monkey Optimization (SMO) has been widely used in various complex optimization problems in recent years. However, the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant. Thus, this paper focuses on how to reconstruct SMO to improve its performance, and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design (SMO 3 ) is developed. A position updating method based on the historical optimal domain and particle swarm for Local Leader Phase (LLP) and Global Leader Phase (GLP) is presented to improve the diversity of the population of SMO. Moreover, an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values. Also, a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time. Furthermore, an extended SMO 3 named CSMO 3 is investigated to deal with constrained optimization problems. The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems. Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.

show abstract

Section: Spider Monkey Algorithm For Unconstrained Optimizationmentioning

confidence: 99%

A Spider Monkey Optimization Algorithm Combining Opposition-Based Learning and Orthogonal Experimental Design

Liao,

Xia,

Jia

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Yang et al [22] proposed a tripartite evolutionary game analysis of network knowledge sharing community. Sun et al [23] proposed a tripartite game to stimulate trust and cooperation in marginal services. Zhang et al [24] proposed the evolution mechanism of haze collaborative governance, which is based on the new evidence from the threeparty evolutionary game model and the case study of China.Seo et al [25] proposed an evolutionary game method for uplink NOMA random access system.Liu et al [26] proposed an evolutionary game of mining pool selection in blockchain network.…”

Section: Introductionmentioning

confidence: 99%

Tripartite evolutionary game in the process of network attack and defense

Chen,

Fan,

Leng

et al. 2024

Telecommun Syst

View full text Add to dashboard Cite

At present, the confrontation in cyberspace is becoming more and more fierce, and network attacks and defenses have become the main form of confrontation between parties in cyberspace. The maximum benefit can be obtained by using scientific decision-making. Traditional network attack and defense research mainly focuses on the relationship between network attackers and network defenders, but enough to explain the benefits of in the evolution of network attacks and defenses. In view of this, this paper constructs a tripartite evolutionary game model among network attackers, network defenders and government regulators, analyzes Article Title the evolutionary stability of each participant's strategy choice, discusses the influence of each element on the tripartite strategic choices, and further analyzes the stability of the equilibrium point of the tripartite evolutionary system. The research results show that (1) the timely supervision of the network by the government supervision department is conducive to enhancing the construction of network security and has strategic significance for the security of cyberspace; (2) the network defense department can obtain more effective defense measures when being attacked by the network; (3) the network defense party can analyze the strategic defense requirements that are more in line with its own benefits. Finally, we use Matlab2021a to conduct simulation analysis, verify the effectiveness of the evolutionary game model under different initial conditions, and put forward reasonable suggestions for network defenders and government regulators according to the analysis conclusions.

show abstract