Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Distributed Nash equilibrium seeking in games with partial decision information: A survey
M Ye, QL Han, L Ding, S Xu - Proceedings of the IEEE, 2023 - ieeexplore.ieee.org
Nash equilibrium, as an essential strategic profile in game theory, is of both practical
relevance and theoretical significance due to its wide penetration into various fields, such as …
relevance and theoretical significance due to its wide penetration into various fields, such as …
An operator splitting approach for distributed generalized Nash equilibria computation
In this paper, we propose a distributed algorithm for computation of a generalized Nash
equilibrium (GNE) in noncooperative games over networks. We consider games in which the …
equilibrium (GNE) in noncooperative games over networks. We consider games in which the …
Analysis and interventions in large network games
We review classic results and recent progress on equilibrium analysis, dynamics, and
optimal interventions in network games with both continuous and discrete strategy sets. We …
optimal interventions in network games with both continuous and discrete strategy sets. We …
Distributed Nash equilibrium seeking for general networked games with bounded disturbances
M Ye, D Li, QL Han, L Ding - IEEE/CAA Journal of Automatica …, 2022 - ieeexplore.ieee.org
This paper is concerned with anti-disturbance Nash equilibrium seeking for games with
partial information. First, reduced-order disturbance observer-based algorithms are …
partial information. First, reduced-order disturbance observer-based algorithms are …
Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
L Pavel - IEEE Transactions on Automatic Control, 2019 - ieeexplore.ieee.org
We consider distributed computation of generalized Nash equilibrium (GNE) over networks,
in games with shared coupling constraints. Existing methods require that each player has …
in games with shared coupling constraints. Existing methods require that each player has …
Differentially private distributed Nash equilibrium seeking for aggregative games
This article considers the privacy-preserving distributed Nash equilibrium seeking strategy
design for average aggregative games, in which the players' objective functions are …
design for average aggregative games, in which the players' objective functions are …
Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
This paper investigates the distributed strategy design to find generalized Nash equilibria
(GNE) of multi-cluster games with nonsmooth payoff functions, a coupled nonlinear …
(GNE) of multi-cluster games with nonsmooth payoff functions, a coupled nonlinear …
Distributed algorithms for searching generalized Nash equilibrium of noncooperative games
In this paper, the distributed Nash equilibrium (NE) searching problem is investigated, where
the feasible action sets are constrained by nonlinear inequalities and linear equations …
the feasible action sets are constrained by nonlinear inequalities and linear equations …
Adaptive generalized nash equilibrium seeking algorithm for nonsmooth aggregative game under dynamic event-triggered mechanism
This paper addresses a nonsmooth aggregative game to control multiple noncooperative
players, each with a nonsmooth cost function that depends not only on its own decision but …
players, each with a nonsmooth cost function that depends not only on its own decision but …
Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
Z Deng - Automatica, 2022 - Elsevier
The aggregative games of multi-agent systems are studied in this paper, where the players
have second-order nonlinear dynamics with uncertain parameters and the communication …
have second-order nonlinear dynamics with uncertain parameters and the communication …