Recent years have witnessed a significant trend towards filling the gap between Social
Network Analysis (SNA) and control theory. This trend was enabled by the introduction of …

In decentralized optimization, nodes cooperate to minimize an overall objective function that
is the sum (or average) of per-node private objective functions. Algorithms interleave local …

In this paper, we study Federated Bandit, a decentralized Multi-Armed Bandit problem with a
set of N agents, who can only communicate their local data with neighbors described by a …

A distributed algorithm is described for solving a linear algebraic equation of the form Ax= b
assuming the equation has at least one solution. The equation is simultaneously solved by …

This paper regards the coordination of networked systems, studied in the framework of
hybrid dynamical systems. We design a coordination scheme which combines the use of …

Two asynchronous distributed algorithms are presented for solving a linear equation of the
form Ax= b with at least one solution. The equation is simultaneously and asynchronously …

Recent advances in wired and wireless technology lead to the emergence of large-scale
networks such as Internet, wireless mobile ad-hoc networks, swarm robotics, smart-grid, and …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes n. The protocol relies …

Distributed averaging (also known as average consensus) is an algorithm that builds on
neighbor to neighbor interactions with the ultimate goal of convergence to the average of all …

This article studies a distributed multiarmed bandit problem with heterogeneous
observations of rewards. The problem is cooperatively solved by agents assuming each …