M. Bianchi
13 records found
1
Authored
The END
Estimation Network Design for Games under Partial-decision Information
Multi-agent decision problems are typically solved via distributed iterative algorithms, where the agents only communicate between themselves on a peerto- peer network. Each agent usually maintains a copy of each decision variable, while agreement among the local copies is enf ...
We study generalized games with full row rank equality coupling constraints and we provide a strikingly simple proof of strong monotonicity of the associated KKT operator. This allows us to show linear convergence to a variational equilibrium of the resulting primal-dual pseud ...
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 its cost function possibly depends on the strategies of all agents. The few existing methods bui ...
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 constraints. In this letter, we study its asynchronous counterpart. Specifically, we assume that each a ...
We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on consensus and primal–dual gradient dyn ...
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 on the strategies of other agents. Our main contribution is the design of a fully-distributed, s ...
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 equilibrium seeking problem by designing a fully-distributed dynamic controller, based on continuous-t ...
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 network, while its cost function depends on the strategies of possibly all agents. In particular, ...
Contributed
We developed and evaluated a robot that adapts to a human, using an adaptation strategy, in such a way as to guide the co-adaptation to have a posit ...