Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
From MaRDI portal
Abstract: In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilibrium may not be achieved with homogenous stepsizes unless certain conditions on the objective function hold. We show that there always exist heterogeneous stepsizes for the proposed algorithm to guarantee that a Nash equilibrium can be achieved for UJSC digraphs. Finally, in two standard weight-unbalanced cases, we verify the convergence to a Nash equilibrium by adaptively updating the stepsizes along with the arc weights in the proposed algorithm.
Cited in
(35)- Nash equilibrium seeking for N-coalition noncooperative games
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Nash equilibrium seeking in N-coalition games via a gradient-free method
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Adaptive distributed optimization algorithms for Euler-Lagrange systems
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Distributed formation control with open-loop Nash strategy
- Multi-cluster distributed optimization via random sleep strategy
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- 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
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation
- Recent advances in optimization and game theoretic control for networked systems
- Two-timescale recurrent neural networks for distributed minimax optimization
- Nash equilibrium seeking with prescribed performance
- On the convergence of distributed projected gradient play with heterogeneous learning rates in monotone games
- Seeking strategy design for distributed nonsmooth games and its application
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed Nash equilibrium seeking for noncooperative games in nonlinear multi-agent systems: an event-triggered neuro-adaptive approach
- Incentive-based fault-tolerant cooperative payoff design in weakly acyclic games
- Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs
- \(\varepsilon\)-Nash equilibrium of non-cooperative Lagrangian dynamic games based on the average sub-gradient robust integral sliding mode control
- Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Differentially private distributed Nash equilibrium seeking based on gradient tracking and communication compression
- Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
- Distributed stochastic Nash equilibrium seeking under heavy-tailed noises
- Predefined-time convergence strategies for multi-cluster games in hybrid heterogeneous systems
- No-regret learning in network stochastic zero-sum games
This page was built for publication: Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980335)
