This paper 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.
6 August 2024 in IEEE Transactions on Automatic Control
This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce a new local edge-based equilibrium condition with full information. Considering challenges when communication delays occur, we then devise an asynchronous distributed algorithm to seek a generalized Nash equilibrium. This asynchronous scheme arbitrarily activates one player to start new computations independently at different iteration instants, which means that the picked player can use the involved out-dated information from itself and its neighbors to perform new updates. In theoretical aspect, we provide explicit conditions on algorithm parameters, for instance, the step-sizes to establish a sublinear convergence rate for the synchronous version. Next, the asynchronous algorithm guarantees almost sure convergence in expectation under the same step-size conditions and some standard assumptions. Finally, the viability and performance of the proposed algorithm are demonstrated by numerical studies on the Cournot competition.
In this paper, the generalized Nash equilibria (GNE) problems over the aggregative game is concerned inspired by the widely application of non-cooperative game in many fields. In the game, each agent aims to minimize its own objective function that depends on both its private decision and the average decision information of all agents’. Furthermore, decision variables are within feasible decision sets and shares a global coupling inequality constraint. To seek the GNE, a novel distributed primal-dual proximal algorithm is proposed. Meanwhile, the proposed algorithm adopts edge-based communication model and takes uncoordinated step-sizes that avoid the conservativeness. By the theories of monotone inclusion and averaged operators, convergence of the algorithm is proved. Finally, numerical studies on electric vehicles path and destination strategy problem are conducted to clarify the efficiency of the proposed algorithm.
In this paper, we proposes a distributed algorithm to seek the generalized Nash equilibria (GNE) problem. We consider aggregative games with affine coupling constraint. In the game, the agent can only interact with neighboring agents. The cost of each agent depends on some aggregate effect of the actions of all the other agents, without the need for multiple communication between agents. The convergence of the algorithm is carried out by the transformation of consensus subspace and the invariance of aggregative estimation.
This paper investigates a distributed convex optimization problem whose objective contains three terms: a local smooth convex function, a local nonsmooth function, and a globally shared, possibly nonsmooth, nonseparable coupling function. To solve this problem, a novel distributed primal-dual proximal gradient algorithm and its asynchronous version are proposed, designated as DPD-PG and AsynDPD-PG, respectively. Each agent communicates with its neighbors locally and updates iteratively with local step-sizes and local relaxation factors. By means of the operator splitting technique, the convergence of the algorithms is rigorously established under mild assumptions. Finally, numerical experiments demonstrate the efficiency of our algorithm, confirming its practical applicability and theoretical soundness.