Answers are grounded in this paper and cite their sources.
Shows linear convergence in distributed generalized Nash equilibrium seeking, suggesting improved game-solving techniques.
This paper develops a discrete-time fully distributed generalized Nash equilibrium (GNE) seeking algorithm over weight-balanced directed graphs to solve the generalized noncooperative games with equality coupling constrains. The proposed algorithm is based on primal-dual gradient play dynamics and dynamic tracking techniques. Under the strong monotonicity and Lipschitz continuity of the pseudo-gradient and the full row rank of the constraints, we provide a proof of linear convergence and the explicit boundaries for the fixed step size, based on contractivity properties of some error terms. The effectiveness of the proposed algorithm is illustrated through a numerical simulation.
No takes yet. Share an insight, caveat, or question.
Xiao et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: