154 citations · 404 across the 11 of their papers we have counts for
3 papers · 2 filters
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…
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…
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…