Skip to Main content Skip to Navigation
Conference papers

How to share knowledge by gossiping

Abstract : 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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Friday, July 21, 2017 - 4:12:43 PM
Last modification on : Wednesday, June 1, 2022 - 4:29:55 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads