Approximate Nash equilibria in large nonconvex aggregative games - EDF Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Approximate Nash equilibria in large nonconvex aggregative games

Résumé

This paper shows the existence of O(1/n^γ)-Nash equilibria in n-player noncooperative aggregative games where the players' cost functions depend only on their own action and the average of all the players' actions, and is lower semicontinuous in the former while γ-Hölder continuous in the latter. Neither the action sets nor the cost functions need to be convex. For an important class of aggregative games which includes congestion games with γ being 1, a proximal best-reply algorithm is used to construct an O(1/n)-Nash equilibria with at most O(n^3) iterations. These results are applied in a numerical example of demand-side management of the electricity system. The asymptotic performance of the algorithm is illustrated when n tends to infinity.
Fichier principal
Vignette du fichier
Shapley_Folkman_game.pdf (504.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03023122 , version 1 (25-11-2020)
hal-03023122 , version 2 (08-10-2021)
hal-03023122 , version 3 (26-09-2022)

Identifiants

  • HAL Id : hal-03023122 , version 2

Citer

Kang Liu, Nadia Oudjane, Cheng Wan. Approximate Nash equilibria in large nonconvex aggregative games. 2021. ⟨hal-03023122v2⟩
174 Consultations
141 Téléchargements

Partager

Gmail Facebook X LinkedIn More