.png){kind=icon}
.png){kind=icon}
Return
Distributed algorithm for ε-generalized Nash equilibria with uncertain coupled constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2020.109313.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we design a distributed algorithm to seek generalized Nash equilibria with uncertain coupled constraints. It is hard to find the exact equilibria directly, because the parameters in the coupled constraint come from general convex sets, which may not have analytic expressions. To solve the problem, we first approximate general convex sets by inscribed polyhedrons and transform the approximate problem into a variational inequality by robust optimization. Then, with help of convex set geometry and metric spaces, we prove that the solution to the variational inequality induces an epsilon-generalized Nash equilibrium of the original game in the worst case. Furthermore, we propose a distributed algorithm to seek an epsilon-generalized Nash equilibrium, and show the convergence analysis with Lyapunov functions and variational inequalities. Finally, we illustrate the effectiveness of the distributed algorithm by a numerical example. (c) 2020 Published by Elsevier Ltd.
Keywords:
Distributed algorithm
Generalized Nash equilibrium
Uncertainty
Coupled constraint
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.