2019
DOI: 10.1109/tcyb.2018.2828118
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Algorithms for Searching Generalized Nash Equilibrium of Noncooperative Games

Abstract: 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. Different from most of the existing investigations on distributed NE searching problems, we consider the case where both cost functions and feasible action sets depend on actions of all players, and each player can only have access to the information of its neighbors. To address this problem, a continuous-time distributed gradient… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
88
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 140 publications
(88 citation statements)
references
References 47 publications
0
88
0
Order By: Relevance
“…where η m and η M are positive scalars. Moreover, here we give the initial condition of system (7) as:…”
Section: Poroblem Formulationmentioning
confidence: 99%
See 4 more Smart Citations
“…where η m and η M are positive scalars. Moreover, here we give the initial condition of system (7) as:…”
Section: Poroblem Formulationmentioning
confidence: 99%
“…Distributed parameter networked control systems with transmission delays and data packet dropouts can be modeled as a closed loops system (7) with time-varying input delays. So the method based on delay information can be used to study system (7).…”
Section: Poroblem Formulationmentioning
confidence: 99%
See 3 more Smart Citations