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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
More generally, the caller’s knowledge becomes common knowledge between i and j. We however have no common knowledge operator in our framework.
References
Apt, K.R., Grossi, D., van der Hoek, W.: Epistemic protocols for distributed gossiping. In: Ramanujam, R. (ed.) Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2015. EPTCS, vol. 215, pp. 51–66 (2015). https://doi.org/10.4204/EPTCS.215.5
Apt, K.R., Grossi, D., van der Hoek, W.: When are two gossips the same? Types of communication in epistemic gossip protocols. CoRR abs/1807.05283 (2018). http://arxiv.org/abs/1807.05283
Apt, K.R., Kopczynski, E., Wojtczak, D.: On the computational complexity of gossip protocols. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 765–771. ijcai.org (2017). https://doi.org/10.24963/ijcai.2017/106
Apt, K.R., Wojtczak, D.: Common knowledge in a logic of gossips. In: Lang, J. (ed.) Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2017. EPTCS, vol. 251, pp. 10–27 (2017). https://doi.org/10.4204/EPTCS.251.2
Apt, K.R., Wojtczak, D.: Decidability of fair termination of gossip protocols. In: Eiter, T., Sands, D., Sutcliffe, G., Voronkov, A. (eds.) IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, vol. 1. Kalpa Publications in Computing, EasyChair (2017). http://www.easychair.org/publications/paper/342983
Attamah, M., van Ditmarsch, H., Grossi, D., van der Hoek, W.: A framework for epistemic gossip protocols. In: Bulling, N. (ed.) EUMAS 2014. LNCS (LNAI), vol. 8953, pp. 193–209. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17130-2_13
Aucher, G., Bolander, T.: Undecidability in epistemic planning. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, 3–9 August 2013, Beijing, China, pp. 27–33. IJCAI/AAAI (2013). http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6903
Bolander, T., Andersen, M.B.: Epistemic planning for single and multi-agent systems. J. Appl. Non-Classical Logics 21(1), 9–34 (2011). https://doi.org/10.3166/jancl.21.9-34
Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1–2), 165–204 (1994). https://doi.org/10.1016/0004-3702(94)90081-7
Cooper, M.C., Herzig, A., Maffre, F., Maris, F., Régnier, P.: A simple account of multi-agent epistemic planning. In: Kaminka et al. [19], pp. 193–201. https://doi.org/10.3233/978-1-61499-672-9-193
Cooper, M.C., Herzig, A., Maffre, F., Maris, F., Régnier, P.: Simple epistemic planning: generalised gossiping. In: Kaminka et al. [19], pp. 1563–1564. https://doi.org/10.3233/978-1-61499-672-9-1563
Cooper, M.C., Herzig, A., Maffre, F., Maris, F., Régnier, P.: Simple epistemic planning: generalised gossiping. CoRR abs/1606.03244 (2016). http://arxiv.org/abs/1606.03244
Cooper, M.C., Maris, F., Régnier, P.: Monotone temporal planning: tractability, extensions and applications. J. Artif. Intell. Res. 50, 447–485 (2014). https://doi.org/10.1613/jair.4358
van Ditmarsch, H., van Eijck, J., Pardo, P., Ramezanian, R., Schwarzentruber, F.: Epistemic protocols for dynamic gossip. J. Appl. Logic 20, 1–31 (2017). https://doi.org/10.1016/j.jal.2016.12.001
van Ditmarsch, H., Grossi, D., Herzig, A., van der Hoek, W., Kuijer, L.B.: Parameters for epistemic gossip problems. In: Proceedings of LOFT 2016 (2016)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319–349 (1988). https://doi.org/10.1002/net.3230180406
Herzig, A., Lorini, E., Maffre, F.: A poor man’s epistemic logic based on propositional assignment and higher-order observation. In: van der Hoek, W., Holliday, W.H., Wang, W. (eds.) LORI 2015. LNCS, vol. 9394, pp. 156–168. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48561-3_13
Herzig, A., Maffre, F.: How to share knowledge by gossiping. AI Commun. 30(1), 1–17 (2017). https://doi.org/10.3233/AIC-170723
Kaminka, G.A., et al. (eds.): 22nd European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, ECAI 2016, vol. 285. IOS Press (2016)
Löwe, B., Pacuit, E., Witzel, A.: DEL planning and some tractable cases. In: van Ditmarsch, H., Lang, J., Ju, S. (eds.) LORI 2011. LNCS (LNAI), vol. 6953, pp. 179–192. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24130-7_13
Maffre, F.: Ignorance is bliss: observability-based dynamic epistemic logics and their applications. Ph.D. thesis, Paul Sabatier University, Toulouse, France (2016). https://tel.archives-ouvertes.fr/tel-01488408
Muise, C.J., et al.: Planning over multi-agent epistemic states: a classical planning approach. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25–30 January 2015, Austin, Texas, USA, pp. 3327–3334. AAAI Press (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9974
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Cooper, M.C., Herzig, A., Maris, F., Vianey, J. (2019). Temporal Epistemic Gossip Problems. In: Slavkovik, M. (eds) Multi-Agent Systems. EUMAS 2018. Lecture Notes in Computer Science(), vol 11450. Springer, Cham. https://doi.org/10.1007/978-3-030-14174-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-14174-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14173-8
Online ISBN: 978-3-030-14174-5
eBook Packages: Computer ScienceComputer Science (R0)