论文标题
动态的弹性网络游戏，具有多代理共识的应用程序
Dynamic Resilient Network Games with Applications to Multi-Agent Consensus
论文作者
论文摘要
考虑了基于游戏理论方法的弹性图形问题的网络系统中的网络安全问题。攻击者删除了一些边缘的攻击者，而后卫试图恢复它们。这两个参与者都受到能量限制的影响，因此他们的行动受到限制，不能连续执行。对于随着时间的推移反复进行的这两个阶段游戏，我们在边缘连接性和图表的连接组件的数量方面对攻击者和防守者的最佳策略进行了表征。然后将弹性图游戏应用于多代理共识问题。我们研究边缘的攻击和恢复如何影响共识过程。最后，我们还提供数值模拟来说明结果。
A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges whereas the defender attempts to recover them. Both players are subject to energy constraints so that their actions are restricted and cannot be performed continuously. For this two-stage game, which is played repeatedly over time, we characterize the optimal strategies for the attacker and the defender in terms of edge connectivity and the number of connected components of the graph. The resilient graph game is then applied to a multi-agent consensus problem. We study how the attacks and the recovery on the edges affect the consensus process. Finally, we also provide numerical simulation to illustrate the results.
