
The distributed dual ascent algorithm is robust to asynchrony
The distributed dual ascent is an established algorithm to solve strongl...
read it

Nash equilibrium seeking under partialdecision information over directed communication networks
We consider the Nash equilibrium problem in a partialdecision informati...
read it

Fully distributed Nash equilibrium seeking over timevarying communication networks with linear convergence rate
We design a distributed algorithm for learning Nash equilibria over time...
read it

Fast generalized Nash equilibrium seeking under partialdecision information
We address the generalized Nash equilibrium (GNE) problem in a partiald...
read it

Continuoustime fully distributed generalized Nash equilibrium seeking for multiintegrator agents
We consider a group of (multi)integrator agents playing games on a netw...
read it

A distributed proximalpoint algorithm for Nash equilibrium seeking under partialdecision information with geometric convergence
We consider the Nash equilibrium seeking problem for a group of noncoope...
read it

A continuoustime distributed generalized Nash equilibrium seeking algorithm over networks for doubleintegrator agents
We consider a system of single or double integrator agents playing a ge...
read it
Mattia Bianchi
is this you? claim profile