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 2019Show all

15 papers · 1 filter

math.OC2019★ 4 cited

Distributed Forward-Backward algorithms for stochastic generalized Nash equilibrium seeking

Barbara Franci, Sergio Grammatico

We consider the stochastic generalized Nash equilibrium problem (SGNEP) with expected-value cost functions. Inspired by Yi and Pavel (Automatica, 2019), we propose a distributed GN…

eess.SY2019

Distributed payoff allocation in coalitional games via time varying paracontractions

Aitazaz Ali Raja, Sergio Grammatico

We present a partial operator-theoretic characterization of approachability principle and based on this characterization, we interpret a particular distributed payoff allocation al…

math.OC2019

An integral Nash equilibrium control scheme for a class of multi-agent linear systems

Suad Krilašević, Sergio Grammatico

We propose an integral Nash equilibrium seeking control (I-NESC) law which steers the multi-agent system composed of a special class of linear agents to the neighborhood of the Nas…

cs.GT2019★ 1 cited

Time-varying constrained proximal type dynamics in multi-agent network games

Carlo Cenedese, Giuseppe Belgioioso, Sergio Grammatico +1

In this paper, we study multi-agent network games subject to affine time-varying coupling constraints and a time-varying communication network. We focus on the class of games adopt…

math.OC2019

A preconditioned Forward-Backward method for partially separable SemiDefinite Programs

Filippo Fabiani, Sergio Grammatico

We present semi-decentralized and distributed algorithms, designed via a preconditioned forward-backward operator splitting, for solving large-scale, decomposable semidefinite prog…

math.OC2019★ 154 cited

Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents

Mattia Bianchi, Sergio Grammatico

We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing contin…

math.OC2019

Charging plug-in electric vehicles as a mixed-integer aggregative game

Carlo Cenedese, Filippo Fabiani, Michele Cucuzzella +3

We consider the charge scheduling coordination of a fleet of plug-in electric vehicles, developing a hybrid decision-making framework for efficient and profitable usage of the dist…

math.OC2019★ 1 cited

Distributed forward-backward (half) forward algorithms for generalized Nash equilibrium seeking

Barbara Franci, Mathias Staudigl, Sergio Grammatico

We present two distributed algorithms for the computation of a generalized Nash equilibrium in monotone games. The first algorithm follows from a forward-backward-forward operator…

math.OC2019

A damped forward-backward algorithm for stochastic generalized Nash equilibrium seeking

Barbara Franci, Sergio Grammatico

We consider a stochastic generalized Nash equilibrium problem (GNEP) with expected-value cost functions. Inspired by Yi and Pavel (Automatica, 2019), we propose a distributed GNE s…

math.OC2019★ 11 cited

A fully-distributed proximal-point algorithm for Nash equilibrium seeking with linear convergence rate

Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico

We address the Nash equilibrium problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost possibly depends…

math.OC2019★ 36 cited

A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents

Mattia Bianchi, Sergio Grammatico

We consider a system of single- or double integrator agents playing a generalized Nash game over a network, in a partial-information scenario. We address the generalized Nash equil…

math.OC2019★ 3 cited

Asynchronous and time-varying proximal type dynamics multi-agent network games

Carlo Cenedese, Giuseppe Belgioioso, Yu Kawano +2

In this paper, we study proximal type dynamics in the context of noncooperative multi-agent network games. These dynamics arise in different applications, since they describe distr…

math.OC2019★ 149 cited

Distributed generalized Nash equilibrium seeking in aggregative games on time-varying networks

Giuseppe Belgioioso, Angelia Nedić, Sergio Grammatico

We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision inform…

math.OC2019

Convergence in uncertain linear systems

Filippo Fabiani, Giuseppe Belgioioso, Franco Blanchini +2

State convergence is essential in several scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, monotone game theory, multi-agent learning over time-…

cs.GT2019★ 7 cited

An asynchronous, forward-backward, distributed generalized Nash equilibrium seeking algorithm

Carlo Cenedese, Giuseppe Belgioioso, Sergio Grammatico +1

In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undire…