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

DOI10.1007/978-3-031-15298-6_15MaRDI QIDQ6160746FDOQ6160746

Authors: Hans van Ditmarsch, Malvin Gattinger 

Publication date: 2 June 2023

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

Recommendations

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

zbMATH Keywords

epistemic logicgossiphigher-order knowledge

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• The Byzantine Generals Problem
• Knowledge and common knowledge in a distributed environment
• Verification of distributed epistemic gossip protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to share knowledge by gossiping
• The logic of gossiping
• Everyone knows that everyone knows

Cited In (2)

• Everyone knows that everyone knows
• 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)