Distributed Generalized Nash Equilibria Computation of Noncooperative Games Via Novel Primal-Dual Splitting Algorithms

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

View graph of relations

Author(s)

  • Liang Ran
  • Huaqing Li
  • Lifeng Zheng
  • Jun Li
  • Zhe Li

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)179-194
Number of pages16
Journal / PublicationIEEE Transactions on Signal and Information Processing over Networks
Volume10
Online published9 Feb 2024
Publication statusPublished - 2024

Abstract

This article investigates the generalized Nash equilibria (GNE) seeking problem for noncooperative games, where all players dedicate to selfishly minimizing their own cost functions subject to local constraints and coupled constraints. To tackle the considered problem, we initially form an explicit local equilibrium condition for its variational formulation. By employing proximal splitting operators, a novel distributed primal-dual splitting algorithm with full-decision information (Dist_PDS_FuDeIn) is designed, eliminating the need for global step-sizes. Furthermore, to address scenarios where players lack access to all other players' decisions, a local estimation is introduced to approximate the decision information of other players, and a fully distributed primal-dual splitting algorithm with partial-decision information (Dist_PDS_PaDeIn) is then proposed. Both algorithms enable the derivation of new distributed forward-backward-like extensions. Theoretically, a new analytical approach for convergence is presented, demonstrating that the proposed algorithms converge to the variational GNE of games, and their convergence rates are also proven, provided that uncoordinated step-sizes are positive and less than explicit upper bounds. Moreover, the approach not only generalizes the forward-backward splitting technique but also improves convergence rates of several well-known algorithms. Finally, the advantages of Dist_PDS_FuDeIn and Dist_PDS_PaDeIn are illustrated through comparative simulations. © 2024 IEEE.

Research Area(s)

  • Distributed algorithm, ,generalized Nash equilibria, game theory, operator splitting

Citation Format(s)

Distributed Generalized Nash Equilibria Computation of Noncooperative Games Via Novel Primal-Dual Splitting Algorithms. / Ran, Liang; Li, Huaqing; Zheng, Lifeng et al.
In: IEEE Transactions on Signal and Information Processing over Networks, Vol. 10, 2024, p. 179-194.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review