activity
20122026
most citedDynamic control of agents playing aggregative games with coupling constraints

213 citations · 1.2k across the 63 of their papers we have counts for

collaborators
Showing 2021 · math.OCShow all

5 papers · 2 filters

math.OC2021

Convergence of sequences: a survey

Barbara Franci, Sergio Grammatico

Convergent sequences of real numbers play a fundamental role in many different problems in system theory, e.g., in Lyapunov stability analysis, as well as in optimization theory an…

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.OC2021

Bregman algorithms for mixed-strategy generalized Nash equilibrium seeking in a class of mixed-integer games

Wicak Ananduta, Sergio Grammatico

We consider the problem of computing a mixed-strategy generalized Nash equilibrium (MS-GNE) for a class of games where each agent has both continuous and integer decision variables…

math.OC2021★ 2 cited

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…

math.OC2021

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…