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

DOI10.1017/S0960129524000082MaRDI QIDQ6646015zbMATH OpenFDO

Authors Hans van Ditmarsch, Malvin Gattinger

Publication date 29 November 2024

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0960129524000082

zbMATH Keywords

epistemic logicgossiphigher-order knowledgeoptimality

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A survey of gossiping and broadcasting in communication networks
• Common knowledge in a logic of gossips
• Epistemic protocols for dynamic gossip
• How to share knowledge by gossiping
• scientific article; zbMATH DE number 2182496 (Why is no real title available?)
• 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?)
• Knowledge and common knowledge in a distributed environment
• Open problems in a logic of gossips
• Strengthening gossip protocols using protocol-dependent knowledge
• The Byzantine Generals Problem
• The epistemic gossip problem
• The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
• The pleasure of gossip
• Verification of distributed epistemic gossip protocols
• When Are Two Gossips the Same?

This page was built for publication: You can only be lucky once: optimal gossip for epistemic goals

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