Seeking strategy design for distributed nonsmooth games and its application
From MaRDI portal
Publication:6136801
Recommendations
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- Distributed continuous-time algorithm for Nash equilibrium seeking of nonsmooth aggregative games
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Discontinuous dynamical systems
- Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
- Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Distributed algorithms for aggregative games on graphs
- Distributed averaging integral Nash equilibrium seeking on networks
- Distributed optimal resource allocation of second-order multiagent systems
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Time Cooperative Engagement
- Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Nash Equilibrium Seeking in Noncooperative Games
- Nash equilibria: the variational approach
- Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
- Nonlinear optimization.
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- The Fundamental Theorem of Linear Algebra
Cited in
(3)
This page was built for publication: Seeking strategy design for distributed nonsmooth games and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136801)