We study in this paper privacy protection in fully distributed Nash equilibrium seeking where a player can only access its own cost function and receive information from its immediate neighbors over a directed communication network. In view of the non-cooperative nature of the underlying decision-making process, it is imperative to protect the privacy of individual players in networked games when sensitive information is involved. We propose an approach that can achieve both accurate convergence and rigorous differential privacy with finite cumulative privacy budget in distributed Nash equilibrium seeking, which is in sharp contrast to existing differential-privacy solutions for networked games that have to trade convergence accuracy for differential privacy. The approach is applicable even when the communication graph is unbalanced and it does not require individual players to have any global structure information of the communication graph. Since the approach utilizes independent noises for privacy protection, it can combat adversaries having access to all shared messages in the network. It is also encryption-free, ensuring high efficiency in communication and computation. Numerical comparison results with existing counterparts confirm the effectiveness of the proposed approach.
翻译:我们在本论文中研究充分分布的纳什均衡中的隐私保护问题,以寻找一个玩家只能利用自己的成本功能并从直接通信网络的近邻那里获得信息。鉴于基本决策过程的不合作性质,在涉及敏感信息时,必须保护网络游戏中个别玩家的隐私。我们提出一种办法,在分配的纳什平衡中,既能实现准确的趋同,又能以有限的累积隐私预算实现严格的差异性隐私保护。这种办法与网络游戏中现有的差别性隐私保护方案形成鲜明的对比,后者必须使不同隐私的趋同性达到贸易趋同的准确性。即使通信图表是不平衡的,也不要求单个玩家拥有任何全球通信图结构的信息。由于这种方法利用独立噪音来保护隐私,它可以打击能够利用网络中所有共享信息的对手。它也是无加密的,确保通信和计算的效率很高。与现有的对口单位的数值比较结果证实了拟议方法的有效性。