Everyone Knows that Everyone Knows
| Authors |
|
|---|---|
| Publication date | 2021 |
| Host editors |
|
| Book title | Mathematics, Logic, and their Philosophies |
| Book subtitle | Essays in Honour of Mohammad Ardeshir |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Logic, Epistemology, and the Unity of Science |
| Pages (from-to) | 117-133 |
| Number of pages | 17 |
| Publisher | Cham: Springer |
| Organisations |
|
| Abstract |
A gossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocol is a telephone call wherein the caller and the callee exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore some protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents super experts. Additionally, we model that agents who already know that all agents are experts, do not make and do not answer calls. We also model that such protocols are common knowledge among the agents. We investigate conditions under which such gossip protocols terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a protocol with missed calls can terminate faster than the same protocol without missed calls. |
| Document type | Chapter |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-030-53654-1_5 |
| Other links | https://www.scopus.com/pages/publications/85105984370 |
| Permalink to this page | |