Distributed robust adaptive equilibrium computation for generalized convex games
From MaRDI portal
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Learning and adaptive systems in artificial intelligence (68T05) Noncooperative games (91A10) Sensitivity (robustness) (93B35) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Abstract: This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through communicating with neighboring players. The particular challenge we consider is that the component functions are unknown a priori to associated players. We study two distributed computation algorithms and analyze their convergence properties in the presence of data transmission delays and dynamic changes of network topologies. The algorithm performance is verified through demand response on the IEEE 30-bus Test System. Our technical tools integrate convex analysis, variational inequalities and simultaneous perturbation stochastic approximation.
Recommendations
- An operator splitting approach for distributed generalized Nash equilibria computation
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Consensus-based and extremum seeking methods for distributed generalized Nash equilibrium
- Algorithm design and approximation analysis on distributed robust game
Cites work
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Constrained Consensus and Optimization in Multi-Agent Networks
- Convex Optimization in Signal Processing and Communications
- Convex optimization theory.
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Delay robustness in consensus problems
- Distributed algorithms for the computation of noncooperative equilibria
- Distributed coverage games for energy-aware mobile sensor networks
- Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
- Distributed robust adaptive equilibrium computation for generalized convex games
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Dynamic noncooperative game theory
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Existence of an Equilibrium for a Competitive Economy
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Nash equilibrium problems
- Introduction to Stochastic Search and Optimization
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Nash Equilibrium Seeking in Noncooperative Games
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Payoff-based dynamics for multiplayer weakly acyclic games
- Set-valued analysis
- Stochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
Cited in
(30)- Nash equilibrium seeking for N-coalition noncooperative games
- Privacy preserving distributed optimization using homomorphic encryption
- Comments on: ``Distributed robust adaptive equilibrium computation for generalized convex games
- An operator splitting approach for distributed generalized Nash equilibria computation
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- On convergence rates of game theoretic reinforcement learning algorithms
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Boltzmann distributed replicator dynamics: population games in a microgrid context
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- An incentive mechanism for agents playing competitive aggregative games
- Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
- Asynchronous schemes for stochastic and misspecified potential games and nonconvex optimization
- Convergence analysis of iterated best response for a trusted computation game
- Algorithm design and approximation analysis on distributed robust game
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- A game-theory-based scheme to facilitate consensus latency minimization in sharding blockchain
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- Distributed Nash equilibrium seeking for multi-cluster aggregative games with applications to location control
- Distributed Nash equilibrium seeking in networked graphical games
- Lattice-based homomorphic encryption for distributed privacy protection
- Safe zeroth-order optimization using quadratic local approximations
- Distributed robust adaptive equilibrium computation for generalized convex games
This page was built for publication: Distributed robust adaptive equilibrium computation for generalized convex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901177)
