Noisy rumor spreading and plurality consensus
Error-correcting codes are efficient methods for handling noisy communication channels in the context of technological networks. However, such elaborate methods differ a lot from the unsophisticated way biological entities are supposed to communicate. ...
Defending non-Bayesian learning against adversarial attacks
This paper addresses the problem of non-Bayesian learning over multi-agent networks, where agents repeatedly collect partially informative observations about an unknown state of the world, and try to collaboratively learn the true state out of m ...
Embedded pattern formation by asynchronous robots without chirality
We consider the Embedded Pattern Formation (epf) problem introduced in Fujinaga et al. (SIAM J Comput 44(3):740---785, 2015). Given a set F of distinct points in the Euclidean plane (called here fixed-points) and a set R of robots such that $$|R|=|F|$$|...
Asynchronous approach in the plane: a deterministic polynomial algorithm
In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other's range of vision. The agents execute ...
Near-optimal self-stabilising counting and firing squads
Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a ...
