An operator splitting approach for distributed generalized Nash equilibria computation
From MaRDI portal
Abstract: In this paper, we propose a distributed primal-dual algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over network systems. In the considered game, not only each player's local objective function depends on other players' decisions, but also the feasible decision sets of all the players are coupled together with a globally shared affine inequality constraint. Adopting the variational GNE, that is the solution of a variational inequality, as a refinement of GNE, we introduce a primal-dual algorithm that players can use to seek it in a distributed manner. Each player only needs to know its local objective function, local feasible set, and a local block of the affine constraint. Meanwhile, each player only needs to observe the decisions on which its local objective function explicitly depends through the interference graph and share information related to multipliers with its neighbors through a multiplier graph. Through a primal-dual analysis and an augmentation of variables, we reformulate the problem as finding the zeros of a sum of monotone operators. Our distributed primal-dual algorithm is based on forward-backward operator splitting methods. We prove its convergence to the variational GNE for fixed step-sizes under some mild assumptions. Then a distributed algorithm with inertia is also introduced and analyzed for variational GNE seeking. Finally, numerical simulations for network Cournot competition are given to illustrate the algorithm efficiency and performance.
Recommendations
- On Distributed Generalized Nash Equilibrium Seeking
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Consensus-based and extremum seeking methods for distributed generalized Nash equilibrium
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
Cites work
- scientific article; zbMATH DE number 2202840 (Why is no real title available?)
- A Social Equilibrium Existence Theorem*
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- An extension of duality to a game-theoretic framework
- An inertial forward-backward algorithm for monotone inclusions
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Convergence rate analysis of several splitting schemes
- Convex analysis and monotone operator theory in Hilbert spaces
- Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control
- Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed Nash equilibrium seeking in networked graphical games
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed algorithms for aggregative games on graphs
- Distributed consensus over digital networks with limited bandwidth and time-varying topologies
- Distributed robust adaptive equilibrium computation for generalized convex games
- Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
- Empirical Centroid Fictitious Play: An Approach for Distributed Learning in Multi-Agent Games
- Game theory for cognitive radio networks: an overview
- Games with coupled propagated constraints in optical networks with multi-link topologies
- Generalized Nash equilibrium problems
- Graph theoretic methods in multiagent networks
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Monotone Operator Methods for Nash Equilibria in Non-potential Games
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- Nash equilibria: the variational approach
- Network games: theory, models, and dynamics
- On the variational equilibrium as a refinement of the generalized Nash equilibrium
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
Cited in
(50)- Asynchronous distributed voltage control in active distribution networks
- Nash equilibrium seeking of monotone N-coalition games
- Distributed robust adaptive equilibrium computation for generalized convex games
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Distributed robust optimization with coupled constraints via Tseng's splitting method
- Distributed Nash equilibrium seeking with order-reduced dynamics based on consensus exact penalty
- An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Distributed convergence to Nash equilibria in network and average aggregative games
- Distributed algorithms of stochastic games for robot systems in smart manufacturing
- Distributed generalized Nash equilibrium seeking: a backward-reflected-forward-backward-based algorithm
- No-regret learning for repeated non-cooperative games with lossy bandits
- Distributed generalized Nash equilibrium seeking for noncooperative games with unknown cost functions
- Communication-efficient distributed Nash equilibrium seeking under switching topologies: a decentralized gradient-based event-triggered scheme
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Generalized Nash equilibrium seeking for networked noncooperative games with a dynamic event-triggered mechanism
- Equilibrium seeking and optimal selection algorithms in peer-to-peer energy markets
- Asynchronous schemes for stochastic and misspecified potential games and nonconvex optimization
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- Distributed stochastic Nash equilibrium seeking under heavy-tailed noises
- Nash equilibrium seeking with prescribed performance
- Multivariate Monotone Inclusions in Saddle Form
- Nash equilibrium seeking in N-coalition games via a gradient-free method
- Learning generalized Nash equilibria in monotone games: a hybrid adaptive extremum seeking control approach
- Private computation of polynomials over networks
- Forward-backward-half forward dynamical systems for monotone inclusion problems with application to v-GNE
- Algorithm design and approximation analysis on distributed robust game
- A distributed Nesterov's approach for fast Nash equilibrium seeking in noncooperative games
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
- Efficient distributed learning in stochastic non-cooperative games without information exchange
- Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs
- Fast generalized Nash equilibrium seeking under partial-decision information
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Learning generalized Nash equilibria in multi-agent dynamical systems via extremum seeking control
- Stochastic generalized Nash equilibrium seeking under partial-decision information
- A consensus-based algorithm for non-convex multiplayer games
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces
- Distributed generalized Nash equilibrium seeking approach via surrogate functions for noncooperative nonconvex games
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Evolution of Mixed Strategies in Monotone Games
- A symmetric Gauss-Seidel based majorized augmented Lagrangian method for generalized Nash equilibrium problems in Hilbert spaces
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- A payoff dynamics model for generalized Nash equilibrium seeking in population games
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
This page was built for publication: An operator splitting approach for distributed generalized Nash equilibria computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737785)
