The END: Estimation Network Design for games under partial-decision information
M Bianchi, S Grammatico - IEEE Transactions on Control of …, 2024 - ieeexplore.ieee.org
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 …
the agents only communicate between themselves on a peerto-peer network. Each agent …
Nash equilibrium seeking over digraphs with row-stochastic matrices and network-independent step-sizes
In this letter, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative
convex games with partial-decision information. We propose a distributed algorithm, where …
convex games with partial-decision information. We propose a distributed algorithm, where …
Estimation Network Design framework for efficient distributed optimization
M Bianchi, S Grammatico - arXiv preprint arXiv:2404.15273, 2024 - arxiv.org
Distributed decision problems features a group of agents that can only communicate over a
peer-to-peer network, without a central memory. In applications such as network control and …
peer-to-peer network, without a central memory. In applications such as network control and …
Constrained multi-cluster game: Distributed Nash equilibrium seeking over directed graphs
Motivated by the complex dynamics of cooperative and competitive interactions within
networked agent systems, multi-cluster games provide a framework for modeling the …
networked agent systems, multi-cluster games provide a framework for modeling the …
Equilibrium seeking in games under partial-decision information
M Bianchi - 2023 - research.tudelft.nl
The topic of this dissertation is the distributed computation of Generalized Nash Equilibria
(GNEs) in multi-agent games with network structure. In particular, we design and analyze …
(GNEs) in multi-agent games with network structure. In particular, we design and analyze …