213 citations · 1.2k across the 63 of their papers we have counts for
12 papers · 1 filter
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…
Payoff distribution in robust coalitional games on time-varying networks
Aitazaz Ali Raja, Sergio Grammatico
In this paper, we consider a sequence of transferable utility (TU) coalitional games where the coalitional values are unknown but vary within certain bounds. As a solution to the r…
Training Generative Adversarial Networks via stochastic Nash games
Barbara Franci, Sergio Grammatico
Generative adversarial networks (GANs) are a class of generative models with two antagonistic neural networks: a generator and a discriminator. These two neural networks compete ag…
Nash equilibrium seeking under partial-decision information over directed communication networks
Mattia Bianchi, Sergio Grammatico
We consider the Nash equilibrium problem in a partial-decision information scenario. Specifically, each agent can only receive information from some neighbors via a communication n…
Learning generalized Nash equilibria in multi-agent dynamical systems via extremum seeking control
Suad Krilašević, Sergio Grammatico
In this paper, we consider the problem of learning a generalized Nash equilibrium (GNE) in strongly monotone games. First, we propose a novel continuous-time solution algorithm tha…
Local Stackelberg equilibrium seeking in generalized aggregative games
Filippo Fabiani, Mohammad Amin Tajeddini, Hamed Kebriaei +1
We propose a two-layer, semi-decentralized algorithm to compute a local solution to the Stackelberg equilibrium problem in aggregative games with coupling constraints. Specifically…
An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games
Carlo Cenedese, Giuseppe Belgioioso, Sergio Grammatico +1
In this paper, we present three distributed algorithms to solve a class of generalized Nash equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) i…
A game-theoretic approach for Generative Adversarial Networks
Barbara Franci, Sergio Grammatico
Generative adversarial networks (GANs) are a class of generative models, known for producing accurate samples. The key feature of GANs is that there are two antagonistic neural net…
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…
Fast generalized Nash equilibrium seeking under partial-decision information
Mattia Bianchi, Giuseppe Belgioioso, Sergio Grammatico
We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only exchange information with some neighbors, although…
Stochastic generalized Nash equilibrium seeking in merely monotone games
Barbara Franci, Sergio Grammatico
We solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone games with expected value cost functions. Specifically, we present the first distributed SGNE…