The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable

DOI10.1007/978-3-031-15298-6_15MaRDI QIDQ6160746zbMATH OpenFDO

Authors Hans van Ditmarsch, Malvin Gattinger

Publication date 2 June 2023

Published in Logic, Language, Information, and Computation (Search for Journal in Brave)

zbMATH Keywords

epistemic logicgossiphigher-order knowledge

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• How to share knowledge by gossiping
• When Are Two Gossips the Same?
• The epistemic gossip problem
• Common knowledge in a logic of gossips

Cites work

• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• scientific article; zbMATH DE number 7594164 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• How to share knowledge by gossiping
• Knowledge and common knowledge in a distributed environment
• The Byzantine Generals Problem
• The logic of gossiping
• Verification of distributed epistemic gossip protocols

Cited in

(1)

• You can only be lucky once: optimal gossip for epistemic goals

This page was built for publication: The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable

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