When Are Two Gossips the Same?

DOI10.29007/WW65zbMATH Open1415.68215OpenAlexW2907231049MaRDI QIDQ5222944FDOQ5222944

Authors: Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/ww65

Recommendations

• Gossiping With Multiple Messages
• The logic of gossiping
• The exact gossiping problem
• What is identical?
• How to share knowledge by gossiping
• When are Two Algorithms the Same?
• Gossip and the efficiency of interactions

zbMATH Keywords

epistemic logicknowledge-based protocolsgossip protocols

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

Cited In (14)

• The epistemic gossip problem
• Verification of distributed epistemic gossip protocols
• How to share knowledge by gossiping
• Common knowledge in email exchanges
• Propositional gossip protocols
• The logic of gossiping
• On decidability of a logic of gossips
• Common knowledge in a logic of gossips
• Everyone knows that everyone knows
• You can only be lucky once: optimal gossip for epistemic goals
• Minimal number of calls in propositional protocols
• The pleasure of gossip
• A Formal Model for Polarization under Confirmation Bias in Social Networks
• Title not available (Why is that?)

This page was built for publication: When Are Two Gossips the Same?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222944)