Dmitry Grishchenko

Filip Hanzely, Jakub Konečný, Nicolas Loizou et al.

In this work we present a randomized gossip algorithm for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for the method and perform extensive numerical experiments.