论文标题
指数NASH均衡寻求的攻击弹性分布式算法
Attack-Resilient Distributed Algorithms for Exponential Nash Equilibrium Seeking
论文作者
论文摘要
本文调查了在有针对性的通信网络上寻求问题的弹性分布式NASH平衡（NE），但受恶意网络攻击。被称为拒绝服务（DOS）攻击的所考虑的攻击被允许大约发生，这是指智能对手进行的交流渠道中断。在如此不安全的网络环境中，网络攻击的存在可能会导致不良的性能降级，甚至可能导致分布式算法的失败，以寻求非合作游戏的NE。因此，上述设置可以提高要解决的问题的实际相关性，同时，它对分布式算法设计和指数收敛分析构成了一些技术挑战。与现有的分布式NE寻求结果相反，在县的通信网络上，提出了一种攻击弹性分布式算法，以便在存在DOS攻击的情况下，可以通过指数收敛速率准确地达到NE。受到[21] - [26]的先前作品的启发，研究了对攻击频率和持续时间的明确分析，以使指数NE能够以抗攻击的弹性寻求指数。
This paper investigates a resilient distributed Nash equilibrium (NE) seeking problem on a directed communication network subject to malicious cyber-attacks. The considered attacks, named as Denial-of-Service (DoS) attacks, are allowed to occur aperiodically, which refers to interruptions of communication channels carried out by intelligent adversaries. In such an insecure network environment, the existence of cyber-attacks may result in undesirable performance degradations or even the failures of distributed algorithm to seek the NE of noncooperative games. Hence, the aforementioned setting can improve the practical relevance of the problem to be addressed and meanwhile, it poses some technical challenges to the distributed algorithm design and exponential convergence analysis. In contrast to the existing distributed NE seeking results over a prefect communication network, an attack-resilient distributed algorithm is presented such that the NE can be exactly reached with an exponential convergence rate in the presence of DoS attacks. Inspired by the previous works in [21]-[26], an explicit analysis of the attack frequency and duration is investigated to enable exponential NE seeking with resilience against attacks.Examples and numerical simulation results are given to show the effectiveness of the proposed design.
