Optimal defense strategy based on the mean field game model for cyber security

摘要

With the evolution of research on defense strategies in cyber security, the choice of an optimal strategy has become a key problem in current studies. Focusing on the balance between individual cost and overall network cost, we present an application of mean field game in large-scale defenders in cyber security, where players seek to construct an optimal defense strategy at their minimum cost. The contributions are threefold: first, we propose an individual cost function based on the mean field game in Hilbert space and discuss the overall network cost function, where each player has discrete-time dynamics. Then, the Nash equilibrium of the individual cost function with infinite players is researched. Finally, we establish an optimal condition in which the game equilibrium is the optimal solution to the overall cost function. Numerical examples are provided to illustrate the effectiveness of the presented strategy with an appropriate assumption.