9 citations · 25 across the 15 of their papers we have counts for
14 papers · 1 filter
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…
A relaxed-inertial forward-backward-forward algorithm for Stochastic Generalized Nash equilibrium seeking
Shisheng Cui, Barbara Franci, Sergio Grammatico +2
In this paper we propose a new operator splitting algorithm for distributed Nash equilibrium seeking under stochastic uncertainty, featuring relaxation and inertial effects. Our wo…
Forward-Backward algorithms for stochastic Nash equilibrium seeking in restricted strongly and strictly monotone games
Barbara Franci, Sergio Grammatico
We study stochastic Nash equilibrium problems with expected valued cost functions whose pseudogradient satisfies restricted monotonicity properties which hold only with respect to…
Stochastic generalized Nash equilibrium seeking under partial-decision information
Barbara Franci, Sergio Grammatico
We consider for the first time a stochastic generalized Nash equilibrium problem, i.e., with expected-value cost functions and joint feasibility constraints, under partial-decision…
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…
Distributed projected-reflected-gradient algorithms for stochastic generalized Nash equilibrium problems
Barbara Franci, Sergio Grammatico
We consider the stochastic generalized Nash equilibrium problem (SGNEP) with joint feasibility constraints and expected-value cost functions. We propose a distributed stochastic pr…