Simple epistemic planning: generalised gossiping

Abstract : The gossip problem, in which information (secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols. We extend the gossip problem to arbitrary epistemic depths. For example, we may require not only that all agents know all secrets but also that all agents know that all agents know all secrets. We give optimal protocols for the generalised gossip problem, in the case of two-way communications, one-way communications and parallel communication. In the presence of negative goals testing the existence of a successful protocol is NP-complete.
Keywords : Gossip problem
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, April 3, 2017 - 1:34:58 PM
Last modification on : Friday, April 12, 2019 - 4:23:06 PM
Document(s) archivé(s) le : Tuesday, July 4, 2017 - 12:59:43 PM


Files produced by the author(s)


  • HAL Id : hal-01500520, version 1
  • OATAO : 17046



Martin Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier. Simple epistemic planning: generalised gossiping. 22nd European Conference on Artificial Intelligence (ECAI 2016), Aug 2016, The Hague, Netherlands. pp. 1563-1564. ⟨hal-01500520⟩



Record views


Files downloads