The END: Estimation Network Design for efficient distributed equilibrium seeking

08/24/2022
by   Mattia Bianchi, et al.
0

Multi-agent decision problems are typically solved via distributed algorithms, where the computational burden is partitioned among a group of agents, only allowed to communicate on a peer-to-peer network. To cope with the limited information available, each processor is required to store a copy of certain variables, while agreement among the local copies is enforced via consensus protocols. This structure often leads to redundancy of the information, poor scalability with the network size, communication and memory overhead. In this paper, we develop a framework for the design and analysis of distributed algorithms, named END, to systematically assign local copies only to a subset of the agents, while still ensuring consistency. END unifies and generalizes several existing (application-specific) approaches, and leverages the original sparsity of the problem to improve efficiency and minimize redundancy. We illustrate the flexibility and potential of END for several methods in the context of consensus optimization and game equilibrium seeking.

READ FULL TEXT
research
11/15/2022

Linear Convergent Distributed Nash Equilibrium Seeking with Compression

Information compression techniques are often employed to reduce communic...
research
11/11/2018

Towards time-varying proximal dynamics in Multi-Agent Network Games

Distributed decision making in multi-agent networks has recently attract...
research
09/24/2019

Asynchronous and time-varying proximal type dynamics multi-agent network games

In this paper, we study proximal type dynamics in the context of noncoop...
research
11/06/2019

DISROPT: a Python Framework for Distributed Optimization

In this paper we introduce DISROPT, a Python package for distributed opt...
research
06/30/2021

Distributed Nash Equilibrium Seeking under Quantization Communication

This paper investigates Nash equilibrium (NE) seeking problems for nonco...
research
03/29/2022

Proximal-like algorithms for equilibrium seeking in mixed-integer Nash equilibrium problems

We consider potential games with mixed-integer variables, for which we p...
research
07/26/2020

Convex Decreasing Algorithms: Distributed Synthesis and Finite-time Termination in Higher Dimension

We introduce a general mathematical framework for distributed algorithms...

Please sign up or login with your details

Forgot password? Click here to reset