Skip to Main content Skip to Navigation
Conference papers

Temporal Epistemic Gossip Problems

Abstract : Gossip problems are planning problems where several agents have to share information (`secrets') by means of phone calls between two agents. In epistemic gossip problems the goal can be to achieve higher-order knowledge, i.e., knowledge about other agents' knowledge; to that end, in a call agents communicate not only secrets, but also agents' knowledge of secrets, agents' knowledge about other agents' knowledge about secrets, etc. Temporal epistemic gossip problems moreover impose constraints on the times of calls. These constraints are of two kinds: either they stipulate that a call between two agents must necessarily be made at some time point, or they stipulate that a call can be made within some possible (set of) interval(s). In the non-temporal version, calls between two agents are either always possible or always impossible. We investigate the complexity of the plan existence problem in this general setting. Concerning the upper bound, we prove that it is in NP in the general case, and that it is in P when the problem is non-temporal and the goal is a positive epistemic formula. As for the lower bound, we prove NP-completeness for two fragments: problems with possibly negative goals even in the non-temporal case, and problems with temporal constraints even if the goal is a set of positive atoms.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02378391
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, November 25, 2019 - 10:55:09 AM
Last modification on : Wednesday, June 9, 2021 - 10:00:28 AM
Long-term archiving on: : Wednesday, February 26, 2020 - 3:02:52 PM

File

cooper_24721.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02378391, version 1
  • OATAO : 24721

Citation

Martin Cooper, Andreas Herzig, Frédéric Maris, Julien Vianey. Temporal Epistemic Gossip Problems. 16th European Conference on Multi-Agent Systems (EUMAS 2018), Dec 2018, Bergen, Norway. pp.1-14. ⟨hal-02378391⟩

Share

Metrics

Record views

103

Files downloads

224