Related papers: Want to Gather? No Need to Chatter!
The question of what global information must distributed rational agents a-priori know about the network in order for equilibrium to be possible is researched here. Until now, distributed algorithms with rational agents have assumed that…
We study the problem of distributed maximum computation in an open multi-agent system, where agents can leave and arrive during the execution of the algorithm. The main challenge comes from the possibility that the agent holding the largest…
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of…
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by the so-called topological interaction rule: agents interact with a fixed number of their…
Gossiping is a communication mechanism, used for fast information dissemination in a network, where each node of the network randomly shares its information with the neighboring nodes. To characterize the notion of fastness in the context…
We consider information dissemination over a network of gossiping agents (nodes). In this model, a source keeps the most up-to-date information about a time-varying binary state of the world, and $n$ receiver nodes want to follow the…
Physical social encounters are governed by a set of socio-psychological behavioral rules with a high degree of uniform validity. Past research has shown how these rules or the resulting properties of the encounters (e.g. the geometry of…
This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their…
We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them to see the positions of the other robots. Most of the…
Flocking behavior of multiple agents can be widely observed in nature such as schooling fish and flocking birds. Recent literature has proposed the possibility that flocking is possible even only a small fraction of agents are informed of…
The ability of a society to make the right decisions on relevant matters relies on its capability to properly aggregate the noisy information spread across the individuals it is made of. In this paper we study the information aggregation…
We consider the dispersion problem for mobile agents. Initially, k agents are located at arbitrary nodes in an undirected graph. Agents can migrate from node to node via an edge in the graph synchronously. Our goal is to let the k agents be…
This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study the convergence properties of such algorithms with the goal…
In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. These abstractions are fundamental coordination problems in cooperative mobile robotics. Moreover, their…
Reaching agreement despite noise in communication is a fundamental problem in multi-agent systems. Here we study this problem under an idealized model, where it is assumed that agents can sense the general tendency in the system. More…
When networked systems of autonomous agents carry out complex tasks, the control and coordination sought after generally depend on a few fundamental control primitives. Chief among these primitives is consensus, where agents are to converge…
We consider a community detection problem for gossip dynamics with stubborn agents in this paper. It is assumed that the communication probability matrix for agent pairs has a block structure. More specifically, we assume that the network…
This paper proposes a distributed algorithm which deterministically gathers n (n > 4) asynchronous, fat robots. The robots are assumed to be transparent and they have full visibility. The robots are initially considered to be stationary. A…
In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. We study the information gathering problem, where each node has a piece of information called a rumor,…
A network of agents attempt to learn some unknown state of the world drawn by nature from a finite set. Agents observe private signals conditioned on the true state, and form beliefs about the unknown state accordingly. Each agent may face…