Completeness and decidability of protocol-dependent knowledge in gossip

DOI10.1007/978-3-032-22626-6_9MaRDI QIDQ7411885zbMATH OpenFDO

Authors Hans van Ditmarsch, Malvin Gattinger, Wouter J. Smit

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22626-6_9

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites work

• A survey of gossiping and broadcasting in communication networks
• Common knowledge in a logic of gossips
• Dealing with unreliable agents in dynamic gossip
• Distributed systems. Principles and paradigms.
• Dynamic gossip
• Epistemic protocols for dynamic gossip
• Everyone knows that everyone knows: gossip protocols for super experts
• Gossips and telephones
• How to share knowledge by gossiping
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• Modal logic
• The epistemic gossip problem
• The logic of gossiping
• You can only be lucky once: optimal gossip for epistemic goals

This page was built for publication: Completeness and decidability of protocol-dependent knowledge in gossip

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