Everyone knows that everyone knows
DOI10.1007/978-3-030-53654-1_5zbMath1498.03067arXiv2011.13203OpenAlexW3127110137MaRDI QIDQ2658278
Rasoul Ramezanian, Rahim Ramezanian, Malvin Gattinger, Hans P. van Ditmarsch
Publication date: 19 March 2021
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.13203
modal logicdynamicsdistributed systemsmulti-agent systemscommon knowledgePDLmulti-agent knowledgegossip protocolhigher-order epistemic goalstelephone problem
Social networks; opinion dynamics (91D30) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Network protocols (68M12) Other applications of logic (03B80) Mathematical logic and foundations (03-XX)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Epistemic protocols for dynamic gossip
- A class of solutions to the gossip problem. I
- New gossips and telephones
- Agreeing to disagree
- The epistemic gossip problem
- Reachability and expectation in gossiping
- Propositional gossip protocols
- The logic of gossiping
- Dynamic gossip
- Gossips and telephones
- Everyone knows that everyone knows
- Simple, Fast and Deterministic Gossip and Rumor Spreading
- The Pleasure of Gossip
- Knowledge and common knowledge in a distributed environment
- A survey of gossiping and broadcasting in communication networks
- How to share knowledge by gossiping
- Quasirandom Rumor Spreading
- When Are Two Gossips the Same?
- Random exchanges of information
- Random exchanges of information
- The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
This page was built for publication: Everyone knows that everyone knows
