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...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 46(2024), 12 vom: 29. Dez., Seite 10797-10813
|
|---|
| Auteur principal: |
Chen, Guanpu
(Auteur) |
|---|
| Autres auteurs: |
Xu, Gehui,
He, Fengxiang,
Hong, Yiguang,
Rutkowski, Leszek,
Tao, Dacheng |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2024
|
|---|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Sujets: | Journal Article |
|---|