When Are Two Gossips the Same?

Van Der Hoek, W, Apt, Krzysztof and Grossi, Davide ORCID: 0000-0002-9709-030X (2018) When Are Two Gossips the Same? In: International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2018-11-16 - 2018-11-21, Awassa, Ethopia.

This is the latest version of this item.

Access the full-text of this item by clicking on the Open Access link.

Text
When_Are_Two_Gossips_the_Same.pdf - Published version
Available under License : See the attached licence file.
Download (436kB)

Official URL: http://dx.doi.org/10.29007/ww65

Abstract

We provide an in-depth study of the knowledge-theoretic aspects of communication in so-called gossip protocols. Pairs of agents communicate by means of calls in order to spread information---so-called secrets---within the group. Depending on the nature of such calls knowledge spreads in different ways within the group. Systematizing existing literature, we identify 18 different types of communication, and model their epistemic effects through corresponding indistinguishability relations. We then provide a classification of these relations and show its usefulness for an epistemic analysis in presence of different communication types. Finally, we explain how to formalise the assumption that the agents have common knowledge of a distributed epistemic gossip protocol.

Item Type:	Conference or Workshop Item (Unspecified)
Uncontrolled Keywords:	cs.MA, cs.MA
Depositing User:	Symplectic Admin
Date Deposited:	07 Nov 2018 08:57
Last Modified:	19 Jan 2023 01:13
DOI:	10.29007/ww65
Open Access URL:	https://easychair.org/publications/paper/3Sxf
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3028309