no code implementations • 3 Feb 2010 • Elchanan Mossel, Noah Olsman, Omer Tamuz
Finally, we show that on trees and on distance transitive-graphs the process converges after $D$ steps, and that it preserves privacy, so that agents learn very little about the private signal of most other agents, despite the efficient aggregation of information.
