A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets.

Journal of Applied Logic
Software Analysis and Transformation

van Ditmarsch, H, van Eijck, D.J.N, Pardo, P, Ramezanian, R, & Schwarzentruber, F. (2017). Epistemic protocols for dynamic gossip. Journal of Applied Logic, 20, 1–31. doi:10.1016/j.jal.2016.12.001