Epistemic protocols for dynamic gossip

Van Ditmarsch, H ; Sharif University of Technology

399 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.jal.2016.12.001
  3. Abstract:
  4. 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. © 2016 Elsevier B.V
  5. Keywords:
  6. Dynamic networks ; Agents ; Communication ; Mathematical techniques ; Connection graphs ; Distributed protocols ; Dynamic network ; Epistemic logic ; Gossip ; Gossip protocols ; Nocv1 ; Telephone numbers ; Two agents ; Formal logic
  7. Source: Journal of Applied Logic ; Volume 20 , 2017 , Pages 1-31 ; 15708683 (ISSN)
  8. URL: https://www.sciencedirect.com/science/article/pii/S1570868316301161