文献类型：期刊文献

中文题名：Distributed generalized Nash equilibrium seeking:event-triggered coding-decoding-based secure communication

作者：Shaofu YANG[1];Wenying XU[2];Wangli HE[3];Jinde CAO[2]

机构：[1]School of Computer Science and Engineering,Southeast University,Nanjing 211189,China;[2]School of Mathematics,Southeast University,Nanjing 211189,China;[3]Key Laboratory of Advanced Control and Optimization for Chemical Processes,East China University of Science and Technology,Shanghai 200237,China

年份：2024

卷号：67

期号：7

起止页码：267

中文期刊名：Science China(Information Sciences)

外文期刊名：中国科学（信息科学）（英文版）

收录：CSTPCD;;Scopus;CSCD:【CSCD2023_2024】；

基金：supported in part by National Natural Science Foundation of China (Grant Nos. 62173087, 62176056, 12326311);Young Elite Scientists Sponsorship Program by the China Association for Science and Technology (Grant No. 2021QNRC001);Joint Fund of Ministry of Education for Equipment Pre-research (Grant Nos. 8091B022234, 8091B030723);Fundamental Research Funds for the Central Universities;Alexander von Humboldt Foundation of Germany;supported by Zhi Shan Youth Scholar Program from Southeast University

语种：英文

中文关键词：noncooperative games;event-triggered communication;coding-decoding;quantization

摘要：In this paper,we consider the distributed generalized Nash equilibrium(GNE)seeking problem in strongly monotone games.The transmission among players is implemented through a digital communication network with limited bandwidth.For improving communication efficiency or/and security,an event-triggered coding-decoding-based communication is first proposed,where the data(decision variable)are first mapped to a series of finite-level codewords and,only when an event condition is satisfied,then sent to the neighboring agents.Moreover,a distributed communication-efficient GNE seeking algorithm is constructed accordingly,and the overrelaxation scheme is further taken into consideration.Through primal-dual analysis,the proposed algorithm is proven to converge to a variational GNE with fixed step-sizes by recasting it as an inexact forward-backward iteration.Finally,numerical simulations illustrate the benefit of the proposed algorithms in terms of saving communication resources.