Simple epistemic planning: generalised gossiping

Martin Cooper (1, 2) , Andreas Herzig (3, 4) , Faustine Maffre (3) , Frédéric Maris (1) , Pierre Régnier (1)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
2 UT3 - Université Toulouse III - Paul Sabatier
3 IRIT-LILaC - Logique, Interaction, Langue et Calcul
4 CNRS - Centre National de la Recherche Scientifique

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.

Mots clés: Gossip problem

Domaines: Intelligence artificielle [cs.AI]; Apprentissage [cs.LG]; Logique en informatique [cs.LO]; Informatique et langage [cs.CL]

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⟩