.png){kind=icon}
.png){kind=icon}
Return
Nash Q-Network for Multi-agent Cybersecurity Simulation
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-08067-7_3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cybersecurity defense involves interactions between adversarial parties (namely defenders and hackers), making multi-agent reinforcement learning (MARL) an ideal approach for modeling and learning strategies for these scenarios. This paper addresses the challenge of simultaneous multi-agent training in complex environments and introduces a Nash Q-Network that enables learning in a partial observation environment. Facilitates learning in partially observed settings. We demonstrate the successful implementation of this algorithm in a notable complex cyber defense simulation treated as a two-player zero-sum Markov game setting. We propose the Nash Q-Network, which aims to learn Nash-optimal strategies that translate to robust defenses in cybersecurity settings. Our approach incorporates aspects of proximal policy optimization (PPO), deep Q-network (DQN), and the Nash-Q algorithm, addressing common challenges like non-stationarity and instability in multi-agent learning. The training process employs distributed data collection and carefully designed neural architectures for both agents and critics.
Keywords:
Cybersecurity
Game Theory
Reinforcement Learning
Journal
G
IF:
0
Papers:
16
Citations:
0