2 papers
math.OC2021
The distributed dual ascent algorithm is robust to asynchrony
Mattia Bianchi, Wicak Ananduta, Sergio Grammatico
The distributed dual ascent is an established algorithm to solve strongly convex multi-agent optimization problems with separable cost functions, in the presence of coupling constr…
math.OC2020
Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate
Mattia Bianchi, Sergio Grammatico
We design a distributed algorithm for learning Nash equilibria over time-varying communication networks in a partial-decision information scenario, where each agent can access its…