On the push-sum algorithm with unreliable communication
Balázs Gerencsér, Université Catholique de Louvain
Abstract:
Given are a few agents, each with some initial value. Their goal is to cooperatively compute the average of the values communicating only using one way packets. The push-sum algorithm is a known and proven way to achieve this. However, the effect of potential communication failures is barely understood. New development on this topic is presented, both error bounds for the case of two agents and partial results for the multi-agent case.