A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
W. Ananduta (TU Delft - Team Sergio Grammatico)
Sergio Grammatico (TU Delft - Team Bart De Schutter, TU Delft - Team Sergio Grammatico)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We present a distributed Nash equilibrium seeking method based on the Bregman forward-backward splitting, which allows us to have a mirror mapping instead of the standard projection as the backward operator. Our main technical contribution is to show convergence to a Nash equilibrium when the game has cocoercive pseudogradient mapping. Furthermore, when the feasible sets of the agents are simplices, a suitable choice of a Legendre function results in an exponentiated pseudogradient method, which, in our numerical experience, performs out the standard projected pseudogradient and dual averaging methods.
help_outline