{"type":"ScholarlyArticle","title":"On the Computational Complexity of Gossip Protocols","authors":[{"name":"Krzysztof R. Apt","slug":"krzysztof-r-apt","given":"Krzysztof R.","family":"Apt","affiliation":"University of Warsaw , Poland; CWI , The Netherlands"},{"name":"Eryk Kopczyński","slug":"eryk-kopczynski","given":"Eryk","family":"Kopczyński","affiliation":"University of Warsaw , Poland"},{"name":"Dominik Wojtczak","slug":"dominik-wojtczak","given":"Dominik","family":"Wojtczak","affiliation":"University of Liverpool , UK"}],"abstract":"Gossip protocols deal with a group of communicating agents, each holding a private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use formulas from an epistemic logic. Recently, the implementability of these distributed protocols was established (which means that the evaluation of these formulas is decidable), and the problems of their partial correctness and termination were shown to be decidable, but their exact computational complexity was left open. We show that for any monotonic type of calls the implementability of a distributed epistemic gossip protocol is a P^{NP}_{||}-complete problem, while the problems of its partial correctness and termination are in coNP^{NP}.","doi":"10.24963/ijcai.2017/106","url":"https://ijcai.org/proceedings/2017/106","pdf":"https://ijcai.org/proceedings/2017/0106.pdf","markdown":"https://ijcai.org/proceedings/2017/106.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/106","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":106,"pages":{"first":765,"last":771},"keywords":["Knowledge Representation, Reasoning, and Logic: Reasoning about Knowlege and Belief","Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Apt and Wojtczak, 2016] Krzysztof R. Apt and Dominik Wojtczak. On decidability of a logic of gossips. In Proc. of the 15th European Conference on Logics in Artificial Intelligence (JELIA 2016), volume 10021 of Lecture Notes in Computer Science, pages 18-33. Springer, 2016.","title":"On decidability of a logic of gossips","authors":"R Krzysztof, Dominik Apt, Wojtczak","year":"2016","venue":"Proc. of the 15th European Conference on Logics in Artificial Intelligence (JELIA 2016)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Apt and Wojtczak, 2017a] Krzysztof R. Apt and Dominik Wojtczak. Common Knowledge in a Logic of Gossips. In Proc. of TARK 2017 (to appear). EPTCS, 2017.","title":"Common Knowledge in a Logic of Gossips","authors":"R Krzysztof, Dominik Apt, Wojtczak","year":"2017","venue":"Proc. of TARK 2017 (to appear)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Apt and Wojtczak, 2017b] Krzysztof R. Apt and Dominik Wojtczak. Decidability of Fair Termination of Gossip Pro- tocols. In Proc. of the IWIL Workshop and LPAR Short Presentations, volume 1, pages 73-85. Kalpa Publications, 2017.","title":"Decidability of Fair Termination of Gossip Protocols","authors":"Apt, R Wojtczak ; Krzysztof, Dominik Apt, Wojtczak","year":"2017","venue":"Proc. of the IWIL Workshop and LPAR Short Presentations","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Apt et al., 2016] Krzysztof R. Apt, Davide Grossi, and Wiebe van der Hoek. Epistemic protocols for distributed gossiping. In Proc. of the 15th Conference on Theoreti- cal Aspects of Rationality and Knowledge (TARK 2015), volume 215 of EPTCS, pages 51-66, 2016.","title":"Epistemic protocols for distributed gossiping","authors":"R Krzysztof, Davide Apt, Wiebe Grossi, Van Der Hoek","year":"2016","venue":"Proc. of the 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Attamah et al., 2014a] Maduka Attamah, Hans van Dit- marsch, Davide Grossi, and Wiebe van der Hoek. A frame- work for epistemic gossip protocols. In Proc of the 12th European Conference on Multi-Agent Systems (EUMAS 2014), pages 193-209, 2014.","title":"A framework for epistemic gossip protocols","authors":"Attamah","year":"2014","venue":"Proc of the 12th European Conference on Multi-Agent Systems (EUMAS 2014)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Attamah et al., 2014b] Maduka Attamah, Hans van Dit- marsch, Davide Grossi, and Wiebe van der Hoek. Knowl- edge and gossip. In Proceedings of ECAI'14. IOS Press, 2014.","title":"Knowledge and gossip","authors":"Attamah","year":"2014","venue":"Proceedings of ECAI'14","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cooper et al., 2016a] Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, and Pierre Régnier. A simple account of multiagent epistemic planning. In Proc. of ECAI 2016, pages 193-201. IOS Press, 2016.","title":"A simple account of multiagent epistemic planning","authors":"Cooper","year":"2016","venue":"Proc. of ECAI 2016","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cooper et al., 2016b] Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, and Pierre Régnier. Sim- ple Epistemic Planning: Generalised Gossiping. In Proc. of ECAI 2016, pages 1563-1564. IOS Press, 2016.","title":"Simple Epistemic Planning: Generalised Gossiping","authors":"Cooper","year":"2016","venue":"Proc. of ECAI 2016","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fagin et al., 1997] Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Knowledge-based programs. Distributed Computing, 10(4):199-225, 1997.","title":"Knowledge-based programs","authors":"Ronald Fagin, Joseph Y Halpern, Yoram Moses, Moshe Y Vardi","year":"1997","venue":"Distributed Computing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hedetniemi et al., 1988] Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, and Arthur L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319-349, 1988.","title":"A survey of gossiping and broadcasting in communication networks","authors":"Sandra Mitchell Hedetniemi, Stephen T Hedetniemi, Arthur L Liestman","year":"1988","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Herzig and Maffre, 2017] Andreas Herzig and Faustine Maf- fre. How to share knowledge by gossiping. AI Communi- cations, 30(1):1-17, 2017.","title":"How to share knowledge by gossiping","authors":"Maffre Herzig","year":"2017","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hromkovic et al., 2005] Juraj Hromkovic, Ralf Klasing, An- drzej Pelc, Peter Ruzicka, and Walter Unger. Dissemination of Information in Communication Networks -Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2005.","title":"Dissemination of Information in Communication Networks -Broadcasting, Gossiping, Leader Election, and Fault-Tolerance","authors":"Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger","year":"2005","venue":"Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kempe et al., 2003] David Kempe, Alin Dobra, and Jo- hannes Gehrke. Gossip-based computation of aggregate information. In Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on, pages 482- 491. IEEE, 2003.","title":"Gossip-based computation of aggregate information","authors":"David Kempe, Alin Dobra, Johannes Gehrke","year":"2003","venue":"Proceedings. 44th Annual IEEE Symposium on","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kermarrec and van Steen, 2007] Anne-Marie Kermarrec and Maarten van Steen. Gossiping in distributed systems. Operating Systems Review, 41(5):2-7, 2007.","title":"Gossiping in distributed systems","authors":"Van Kermarrec, Anne-Marie Steen, Maarten Kermarrec, Van Steen","year":"2007","venue":"Operating Systems Review","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Khuller et al., 2003] Samir Khuller, Yoo-Ah Kim, and Yung- Chun Justin Wan. Algorithms for data migration with cloning. In Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 27-36. ACM, 2003.","title":"Algorithms for data migration with cloning","authors":"Samir Khuller, Yoo-Ah Kim, Yung-Chun Justin, Wan","year":"2003","venue":"Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Ladin et al., 1992] Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat. Providing high availability using lazy replication. ACM Transactions on Computer Systems (TOCS), 10(4):360-391, 1992.","title":"Providing high availability using lazy replication","authors":"Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat","year":"1992","venue":"ACM Transactions on Computer Systems (TOCS)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Liben-Nowell, 2002] David Liben-Nowell. Gossip is syn- teny: Incomplete gossip and the syntenic distance between genomes. Journal of Algorithms, 43(2):264-283, 2002.","title":"Gossip is synteny: Incomplete gossip and the syntenic distance between genomes","authors":"David Liben-Nowell","year":"2002","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Spakowski and Vogel, 2000] Holger Spakowski and Jörg Vo- gel. Θ p 2 -completeness: A classical approach for new results. In International Conference on Foundations of Software Technology and Theoretical Computer Science, pages 348- 360. Springer, 2000.","title":"Holger Spakowski and Jörg Vogel. Θ p 2 -completeness: A classical approach for new results","authors":"Spakowski, Vogel","year":"2000","venue":"International Conference on Foundations of Software Technology and Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tijdeman, 1971] Robert Tijdeman. On a telephone problem. Nieuw Archief voor Wiskunde, 3(XIX):188-192, 1971.","title":"On a telephone problem","authors":"Robert Tijdeman","year":"1971","venue":"Nieuw Archief voor Wiskunde","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[van der Meyden and Wilke, 2005] Ron van der Meyden and Thomas Wilke. Synthesis of distributed systems from knowledge-based specifications. In Proceedings 16th Inter- national Conference CONCUR 2005, volume 3653 of Lec- ture Notes in Computer Science, pages 562-576. Springer, 2005.","title":"Synthesis of distributed systems from knowledge-based specifications","authors":"Van Der Meyden, Thomas Wilke ; Ron Van Der Meyden, Wilke","year":"2005","venue":"Proceedings 16th International Conference CONCUR 2005","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[van Ditmarsch et al., 2017] Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, and François Schwarzentruber. Epistemic protocols for dynamic gos- sip. Journal of Applied Logic, 20:1-31, 2017.","title":"Epistemic protocols for dynamic gossip","authors":"Van Ditmarsch","year":"2017","venue":"Journal of Applied Logic","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wagner, 1987] Klaus W. Wagner. More complicated ques- tions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51(1-2):53-80, 1987.","title":"More complicated questions about maxima and minima, and some closures of NP","authors":"Klaus W Wagner","year":"1987","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}