How to share knowledge by gossiping - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

How to share knowledge by gossiping


Given n agents each of which has a secret (a fact not known to anybody else), the classical version of the gossip problem is to achieve shared knowledge of all secrets in a minimal number of phone calls. There exist protocols achieving shared knowledge in 2(n−2) calls: when the protocol terminates everybody knows all the secrets. We generalize that problem and focus on higher-order shared knowledge: how many calls does it take to obtain that everybody knows that everybody knows all secrets? More generally, how many calls does it take to obtain shared knowledge of order k? This requires not only the communication of secrets, but also the communication of knowledge about secrets. We give a protocol that works in (k+1)(n−2) steps and prove that it is correct: it achieves shared knowledge of level k. The proof is presented in a dynamic epistemic logic that is based on the observability of propositional variables by agents.
Fichier principal
Vignette du fichier
herzig_16867.pdf (232.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01567082 , version 1 (21-07-2017)


  • HAL Id : hal-01567082 , version 1
  • OATAO : 16867


Andreas Herzig, Faustine Maffre. How to share knowledge by gossiping. 13th International Conference on Agreement Technologies in European Conference on Multi-Agent Systems (EUMAS/AT 2015), Dec 2015, Athens, Greece. pp. 249-263. ⟨hal-01567082⟩
89 View
106 Download


Gmail Facebook X LinkedIn More