{"type":"ScholarlyArticle","title":"Propositional Gossip Protocols under Fair Schedulers","authors":[{"name":"Joseph Livesey","slug":"joseph-livesey","given":"Joseph","family":"Livesey","affiliation":"University of Liverpool , UK"},{"name":"Dominik Wojtczak","slug":"dominik-wojtczak","given":"Dominik","family":"Wojtczak","affiliation":"University of Liverpool , UK"}],"abstract":"Gossip protocols are programs that can be used by a group of agents to synchronize what information they have. Namely, assuming each agent holds a secret, the goal of a protocol is to reach a situation in which all agents know all secrets. Distributed epistemic gossip protocols use epistemic formulas in the component programs for the agents. In this paper, we study the simplest classes of such gossip protocols: propositional gossip protocols, in which whether an agent wants to initiate a call depends only on the set of secrets that the agent currently knows. It was recently shown that such a protocol can be correct, i.e., always terminates in a state where all agents know all secrets, only when its communication graph is complete. We show here that this characterization dramatically changes when the usual fairness constraints are imposed on the call scheduler used. Finally, we establish that checking the correctness of a given propositional protocol under a fair scheduler is a coNP-complete problem.","doi":"10.24963/ijcai.2022/56","url":"https://ijcai.org/proceedings/2022/56","pdf":"https://ijcai.org/proceedings/2022/0056.pdf","markdown":"https://ijcai.org/proceedings/2022/56.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/56","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":56,"pages":{"first":391,"last":397},"keywords":["Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Planning and Scheduling: Distributed; Multi-agent Planning","Knowledge Representation and Reasoning: Reasoning about Knowledge and Belief","Agent-based and Multi-agent Systems: Agent Theories and Models","Planning and Scheduling: Theoretical Foundations of Planning"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986954","length_sec":88,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985097","length_sec":352,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Apt and Wojtczak, 2017] Krzysztof R. Apt and Dominik Wojtczak. Decidability of fair termination of gossip pro- tocols. In Proc. of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reason- ing (LPAR 21), pages 73-85, 2017.","title":"Decidability of fair termination of gossip protocols","authors":"R Krzysztof, Dominik Apt, Wojtczak","year":"2017","venue":"Proc. of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 21)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Apt and Wojtczak, 2018] Krzysztof R. Apt and Dominik Wojtczak. Verification of distributed epistemic gossip pro- tocols. J. Artif. Intell. Res. (JAIR), 62:101-132, 2018.","title":"Verification of distributed epistemic gossip protocols","authors":"R Krzysztof, Dominik Apt, Wojtczak","year":"2018","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Apt and Wojtczak, 2019] Krzysztof R. Apt and Dominik Wojtczak. Open problems in a logic of gossips. In Pro- ceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2019), volume 297 of EPTCS, pages 1-18, 2019.","title":"Open problems in a logic of gossips","authors":"R Krzysztof, Dominik Apt, Wojtczak","year":"2019","venue":"Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2019)","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 Proceedings of the 15th Conference on Theo- retical 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":"Proceedings of the 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Apt et al., 2017] Krzysztof R. Apt, Eryk Kopczyński, and Dominik Wojtczak. On the computational complexity of gossip protocols. In Proceedings of the Twenty-Sixth Inter- national Joint Conference on Artificial Intelligence, IJCAI 2017, pages 765-771, 2017.","title":"On the computational complexity of gossip protocols","authors":"R Krzysztof, Eryk Apt, Dominik Kopczyński, Wojtczak","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/106"},{"position":6,"raw":"[Apt et al., 2018] Krzysztof R. Apt, Davide Grossi, and Wiebe van der Hoek. When are two gossips the same? In Gilles Barthe, Geoff Sutcliffe, and Margus Veanes, edi- tors, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pages 36-55. EasyChair, 2018.","title":"When are two gossips the same?","authors":"R Krzysztof, Davide Apt, Wiebe Grossi, Van Der Hoek","year":"2018","venue":"LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Attamah et al., 2014] Maduka Attamah, Hans Van Dit- marsch, Davide Grossi, and Wiebe van der Hoek. Knowl- edge and gossip. In Proceedings of ECAI'14, pages 21-26. IOS Press, 2014.","title":"Knowledge and gossip","authors":"Maduka Attamah, Hans Van Ditmarsch, Davide Grossi, Wiebe Van Der Hoek","year":"2014","venue":"Proceedings of ECAI'14","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bumby, 1981] Richard T Bumby. A problem with tele- phones. SIAM Journal on Algebraic Discrete Methods, 2(1):13-18, 1981.","title":"A problem with telephones","authors":"T Richard, Bumby","year":"1981","venue":"SIAM Journal on Algebraic Discrete Methods","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cooper et al., 2016] Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, and Pierre Régnier. Sim- ple Epistemic Planning: Generalised Gossiping. In Proceed- ings of ECAI 2016, volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1563-1564. IOS Press, 2016.","title":"Simple Epistemic Planning: Generalised Gossiping","authors":"Martin C Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Pierre Régnier","year":"2016","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cooper et al., 2018] Martin C. Cooper, Andreas Herzig, Frédéric Maris, and Julien Vianey. Temporal epistemic gossip problems. In European Conference on Multi-Agent Systems, pages 1-14. Springer, 2018.","title":"Temporal epistemic gossip problems","authors":"Martin C Cooper, Andreas Herzig, Frédéric Maris, Julien Vianey","year":"2018","venue":"European Conference on Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":11,"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":12,"raw":"[Harary and Schwenk, 1974] Frank Harary and Allen J Schwenk. The communication problem on graphs and di- graphs. Journal of the Franklin Institute, 297(6):491-495, 1974.","title":"The communication problem on graphs and digraphs","authors":"Schwenk Harary, Frank Harary, Allen J Schwenk","year":"1974","venue":"Journal of the Franklin Institute","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hedetniemi et al., 1988] Sandra M. 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 M Hedetniemi, Stephen T Hedetniemi, Arthur L Liestman","year":"1988","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":14,"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":15,"raw":"[Hromkovič et al., 2005] Juraj Hromkovič, 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 Hromkovič, 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":16,"raw":"[Kempe et al., 2003] David Kempe, Alin Dobra, and Jo- hannes Gehrke. Gossip-based computation of aggregate information. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03, pages 482-491. IEEE, 2003.","title":"Gossip-based computation of aggregate information","authors":"David Kempe, Alin Dobra, Johannes Gehrke","year":"2003","venue":"Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03","doi":null,"url":null,"internal_url":null},{"position":17,"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":18,"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":19,"raw":"[Livesey and Wojtczak, 2021a] Joseph Livesey and Dominik Wojtczak. Minimal number of calls in propositional pro- tocols. In International Conference on Reachability Prob- lems, pages 132-148. Springer, 2021.","title":"Minimal number of calls in propositional protocols","authors":"Wojtczak Livesey, Joseph Livesey, Dominik Wojtczak","year":"2021","venue":"International Conference on Reachability Problems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Livesey and Wojtczak, 2021b] Joseph Livesey and Dominik Wojtczak. Propositional gossip protocols. In Proc. of 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021), pages 354-370. Springer, 2021.","title":"Propositional gossip protocols","authors":"Wojtczak Livesey, Joseph Livesey, Dominik Wojtczak","year":"2021","venue":"Proc. of 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021)","doi":null,"url":null,"internal_url":null},{"position":21,"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":22,"raw":"[van Ditmarsch and Kokkinis, 2017] Hans van Ditmarsch and Ioannis Kokkinis. The expected duration of sequential gossiping. In Multi-Agent Systems and Agreement Tech- nologies, pages 131-146. Springer, 2017.","title":"The expected duration of sequential gossiping","authors":"Van Ditmarsch, ; Kokkinis, Ioannis Hans Van Ditmarsch, Kokkinis","year":"2017","venue":"Multi-Agent Systems and Agreement Technologies","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[van Ditmarsch et al., 2017a] Hans van Ditmarsch, Ioannis Kokkinis, and Anders Stockmarr. Reachability and expec- tation in gossiping. In PRIMA 2017: Principles and Prac- tice of Multi-Agent Systems, pages 93-109, Cham, 2017. Springer International Publishing.","title":"Reachability and expectation in gossiping","authors":"Van Ditmarsch","year":"2017","venue":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[van Ditmarsch et al., 2017b] Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, and Franc ¸ois Schwarzentruber. Epistemic protocols for dynamic gos- sip. J. of Applied Logic, 20(C):1-31, 2017.","title":"Epistemic protocols for dynamic gossip","authors":"Van Ditmarsch","year":"2017","venue":"J. of Applied Logic","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[van Ditmarsch et al., 2020] Hans van Ditmarsch, Wiebe van Der Hoek, and Louwe B Kuijer. The logic of gossiping. Artificial Intelligence, 286:103306, 2020.","title":"The logic of gossiping","authors":"Van Ditmarsch","year":"2020","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}