Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts

Open Access
Authors
Publication date 06-2023
Journal Studia Logica
Volume | Issue number 111 | 3
Pages (from-to) 453–499
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract

A gossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocol is a pairwise message exchange (telephone call) wherein the calling agents exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents super experts. We also investigate gossip protocols that are common knowledge among the agents. Additionally, we model that agents who are super experts do not make and do not answer calls, and that this is common knowledge. We investigate conditions under which protocols terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a commonly known protocol with engaged agents may terminate faster than the same commonly known protocol without engaged agents.

Document type Article
Language English
Published at https://doi.org/10.48550/arXiv.2011.13203 https://doi.org/10.1007/s11225-022-10032-3
Other links https://www.scopus.com/pages/publications/85147028197
Downloads
2011.13203 (Accepted author manuscript)
Permalink to this page
Back