Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
From MaRDI portal
Publication:2212584
DOI10.1016/j.ins.2019.03.047zbMath1452.91055OpenAlexW2922551119WikidataQ128188485 ScholiaQ128188485MaRDI QIDQ2212584
Chong-Xiao Shi, Guang-Hong Yang
Publication date: 24 November 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.03.047
Related Items (7)
Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme ⋮ Hierarchical optimal control for input-affine nonlinear systems through the formulation of Stackelberg game ⋮ Generalized Nash equilibrium seeking for networked noncooperative games with a dynamic event-triggered mechanism ⋮ A generalized approach to solve perfect Bayesian Nash equilibrium for practical network attack and defense ⋮ Resilient penalty function method for distributed constrained optimization under Byzantine attack ⋮ Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management ⋮ Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
Cites Work
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed robust adaptive equilibrium computation for generalized convex games
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Event-triggered discrete-time distributed consensus optimization over time-varying graphs
- Event-triggered feedback stabilization of switched linear systems using dynamic quantized input
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Distributed fault-tolerant control for a class of cooperative uncertain systems with actuator failures and switching topologies
- Distributed Algorithms for Aggregative Games on Graphs
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Dynamic Incentives for Congestion Control
- Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
- Event-Triggered Quantized Communication-Based Distributed Convex Optimization
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Distributed Subgradient Method With Edge-Based Event-Triggered Communication
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- Event-Triggered Real-Time Scheduling of Stabilizing Control Tasks
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Distributed Event-Triggered Control for Multi-Agent Systems
- Periodic Event-Triggered Control for Linear Systems
This page was built for publication: Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
