Algorithm design and approximation analysis on distributed robust game
From MaRDI portal
Abstract: We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst case. However, it is challenging to obtain the exact equilibria directly because the parameters are from general convex sets, which may not have analytic expressions or are endowed with high-dimensional nonlinearities. To solve this problem, we first approximate parameter sets with inscribed polyhedrons, and transform the approximate problem in the worst case into an extended certain game with resource allocation constraints by robust optimization. Then we propose a distributed algorithm for this certain game and prove that an equilibrium obtained from the algorithm induces an -generalized Nash equilibrium of the original game, followed by convergence analysis. Moreover, resorting to the metric spaces and the analysis on nonlinear perturbed systems, we estimate the approximation accuracy related to and point out the factors influencing the accuracy of .
Recommendations
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Distributed robust adaptive equilibrium computation for generalized convex games
- Distributed continuous-time algorithm for Nash equilibrium seeking of nonsmooth aggregative games
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters
Cites work
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- An operator splitting approach for distributed generalized Nash equilibria computation
- Approximation of convex sets by polytopes
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters
- Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
- Distributed sub-optimal resource allocation via a projected form of singular perturbation
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- scientific article; zbMATH DE number 2208569 (Why is no real title available?)
- Nonlinear systems.
- On the angular metrics between linear subspaces
- Robust game theory
- The gap metric: Robustness of stabilization of feedback systems
- Theory and applications of robust optimization
- Unitarily Invariant Metrics on the Grassmann Space
Cited in
(6)- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Equalizer zero-determinant strategy in discounted repeated Stackelberg asymmetric game
- A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
- A distributed Nesterov's approach for fast Nash equilibrium seeking in noncooperative games
- Distributed optimization and scaling design for solving Sylvester equations
- Distributed robust adaptive equilibrium computation for generalized convex games
This page was built for publication: Algorithm design and approximation analysis on distributed robust game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076815)
