Distributed convergence to Nash equilibria in two-network zero-sum games
From MaRDI portal
Abstract: This paper considers a class of strategic scenarios in which two networks of agents have opposing objectives with regards to the optimization of a common objective function. In the resulting zero-sum game, individual agents collaborate with neighbors in their respective network and have only partial knowledge of the state of the agents in the other network. For the case when the interaction topology of each network is undirected, we synthesize a distributed saddle-point strategy and establish its convergence to the Nash equilibrium for the class of strictly concave-convex and locally Lipschitz objective functions. We also show that this dynamics does not converge in general if the topologies are directed. This justifies the introduction, in the directed case, of a generalization of this distributed dynamics which we show converges to the Nash equilibrium for the class of strictly concave-convex differentiable functions with locally Lipschitz gradients. The technical approach combines tools from algebraic graph theory, nonsmooth analysis, set-valued dynamical systems, and game theory.
Recommendations
- Distributed convergence to Nash equilibria in network and average aggregative games
- Distributed Nash equilibrium seeking in networked graphical games
- Fictitious play in networks
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Distributed algorithms for aggregative games on graphs
Cites work
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 895182 (Why is no real title available?)
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Best response dynamics for continuous games
- Best response dynamics for continuous zero-sum games
- Consensus and Cooperation in Networked Multi-Agent Systems
- Discontinuous dynamical systems
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed algorithms for the computation of noncooperative equilibria
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Graph theoretic methods in multiagent networks
- Matrix Analysis
- Nash Equilibrium Seeking in Noncooperative Games
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Optimization and nonsmooth analysis
- Stability of primal-dual gradient dynamics and applications to network optimization
- Subgradient methods for saddle-point problems
Cited in
(34)- Mechanism design for demand management in energy communities
- On the convergence of multicast games in directed networks
- Distributed formation control with open-loop Nash strategy
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- Hypergame theory: a model for conflict, misperception, and deception
- Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs
- Exponential stability of partial primal-dual gradient dynamics with nonsmooth objective functions
- Constrained distributed optimization: a population dynamics approach
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Equilibrium topology of multi-agent systems with two leaders: a zero-sum game perspective
- Competitive diffusion in signed social networks: a game-theoretic perspective
- Recent advances in optimization and game theoretic control for networked systems
- A game-theory-based scheme to facilitate consensus latency minimization in sharding blockchain
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Distributed Nash equilibrium seeking for noncooperative games in nonlinear multi-agent systems: an event-triggered neuro-adaptive approach
- An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
- Two-timescale recurrent neural networks for distributed minimax optimization
- Multi-cluster distributed optimization via random sleep strategy
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- On the emergence of oscillations in distributed resource allocation
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Distributed accelerated Nash equilibrium learning for two-subnetwork zero-sum game with bilinear coupling
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
This page was built for publication: Distributed convergence to Nash equilibria in two-network zero-sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522807)
