Privacy Preserving Randomized Gossip Algorithms
From MaRDI portal
Abstract: In this work we present three different randomized gossip algorithms 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 all methods, and perform extensive numerical experiments.
This page was built for publication: Privacy Preserving Randomized Gossip Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288214)
