Prescribed-time distributed Nash equilibrium seeking for noncooperation games
From MaRDI portal
Publication:6164041
DOI10.1016/j.automatica.2023.110933zbMath1520.91027OpenAlexW4323359287MaRDI QIDQ6164041
Qianle Tao, Yu Zhao, Chengxin Xian, Zhi-Sheng Duan, Zhongkui Li
Publication date: 30 June 2023
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2023.110933
Cites Work
- Unnamed Item
- A leader-following rendezvous problem of double integrator multi-agent systems
- Distributed convergence to Nash equilibria in two-network zero-sum games
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- Distributed robust adaptive equilibrium computation for generalized convex games
- Distributed discrete-time coordinated tracking with a time-varying reference state and limited communication
- A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
- Appointed-time consensus: accurate and practical designs
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games
- Fixed-time bipartite synchronization with a pre-appointed settling time over directed cooperative-antagonistic networks
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Real and Complex Monotone Communication Games
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- Fixed-Time Stable Gradient Flows: Applications to Continuous-Time Optimization
- Distributed Nash Equilibrium Seeking With Limited Cost Function Knowledge via a Consensus-Based Gradient-Free Method
- Continuous-Time Penalty Methods for Nash Equilibrium Seeking of a Nonsmooth Generalized Noncooperative Game
- Design of Distributed Event-Triggered Average Tracking Algorithms for Homogeneous and Heterogeneous Multiagent Systems
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games
- Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Nonlinear Feedback Design for Fixed-Time Stabilization of Linear Control Systems
- Appointed-Time and Attack-Free Bipartite Synchronization of Generic Linear Multiagent Systems Over Directed Switching Networks
This page was built for publication: Prescribed-time distributed Nash equilibrium seeking for noncooperation games