Distributed convergence to Nash equilibria in two-network zero-sum games
From MaRDI portal
Publication:522807
DOI10.1016/J.AUTOMATICA.2013.02.062zbMATH Open1360.91012arXiv1204.0852OpenAlexW2056226204MaRDI QIDQ522807FDOQ522807
Publication date: 19 April 2017
Published in: Automatica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1204.0852
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix Analysis
- Distributed algorithms for the computation of noncooperative equilibria
- Subgradient methods for saddle-point problems
- Optimization and nonsmooth analysis
- Consensus and Cooperation in Networked Multi-Agent Systems
- Discontinuous dynamical systems
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Stability of primal-dual gradient dynamics and applications to network optimization
- Best response dynamics for continuous zero-sum games
- Best response dynamics for continuous games
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
Cited In (32)
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Competitive diffusion in signed social networks: a game-theoretic perspective
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Hypergame theory: a model for conflict, misperception, and deception
- Distributed Nash equilibrium seeking for noncooperative games in nonlinear multi-agent systems: an event-triggered neuro-adaptive approach
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Exponential stability of partial primal-dual gradient dynamics with nonsmooth objective functions
- Dynamical Systems Coupled with Monotone Set-Valued Operators: Formalisms, Applications, Well-Posedness, and Stability
- Constrained distributed optimization: a population dynamics approach
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Distributed formation control with open-loop Nash strategy
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
- A game-theory-based scheme to facilitate consensus latency minimization in sharding blockchain
- An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
- Two-timescale recurrent neural networks for distributed minimax optimization
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- Multi-cluster distributed optimization via random sleep strategy
- Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- On the convergence of multicast games in directed networks
- Mechanism design for demand management in energy communities
- On the emergence of oscillations in distributed resource allocation
- Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs
- Equilibrium topology of multi-agent systems with two leaders: a zero-sum game perspective
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Recent advances in optimization and game theoretic control for networked systems
- Distributed averaging integral Nash equilibrium seeking on networks
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
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)
