Approaching the Global Nash Equilibrium of Non-Convex Multi-Player Games
Many machine learning problems can be formulated as non-convex multi-player games. Due to non-convexity, it is challenging to obtain the existence condition of the global Nash equilibrium (NE) and design theoretically guaranteed algorithms. This paper studies a class of non-convex multi-player games...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 46(2024), 12 vom: 15. Nov., Seite 10797-10813
|
|---|
| 1. Verfasser: |
Chen, Guanpu
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Xu, Gehui,
He, Fengxiang,
Hong, Yiguang,
Rutkowski, Leszek,
Tao, Dacheng |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2024
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article |
|---|