Seeking strategy design for distributed nonsmooth games and its application
From MaRDI portal
Publication:6136801
DOI10.1016/J.JFRANKLIN.2023.06.004zbMATH Open1520.91013OpenAlexW4380154210MaRDI QIDQ6136801FDOQ6136801
Authors: Zhenhua Deng, Jin Luo 
Publication date: 31 August 2023
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2023.06.004
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
Applications of game theory (91A80) Economic models of real-world systems (e.g., electricity markets, etc.) (91B74) Noncooperative games (91A10) Games involving graphs (91A43)
Cites Work
- Generalized Nash equilibrium problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear optimization.
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Discontinuous dynamical systems
- Nash equilibria: the variational approach
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
- On the characterization of solution sets of smooth and nonsmooth convex stochastic Nash games
- Distributed algorithms for aggregative games on graphs
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- The Fundamental Theorem of Linear Algebra
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
- Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Distributed optimal resource allocation of second‐order multiagent systems
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
- Finite-Time Cooperative Engagement
- Distributed averaging integral Nash equilibrium seeking on networks
- A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Decentralized proximal splitting algorithms for composite constrained convex optimization
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)
