Everyone Knows that Everyone Knows: Gossip Protocols for Super Experts

11/26/2020
by   Hans van Ditmarsch, et al.
0

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 calling agents 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 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 are super experts do not make and do not answer calls. Such agents are called engaged agents. We also model that such gossip protocols are common knowledge among the agents. We investigate conditions under which 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 commonly known protocol with engaged agents may terminate faster than the same protocol without engaged agents.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2019

Strengthening Gossip Protocols using Protocol-Dependent Knowledge

Distributed dynamic gossip is a generalization of the classic telephone ...
research
05/10/2023

Optimal Eventual Byzantine Agreement Protocols with Omission Failures

Work on optimal protocols for Eventual Byzantine Agreement (EBA) – proto...
research
03/03/2014

Extending Agents by Transmitting Protocols in Open Systems

Agents in an open system communicate using interaction protocols. Suppos...
research
11/15/2022

Weighting Experts with Inaccurate Judges

We consider the problem of aggregating binary votes from an ensemble of ...
research
08/03/2022

A Deep Learning Approach to Detect Lean Blowout in Combustion Systems

Lean combustion is environment friendly with low NOx emissions and also ...
research
06/10/2016

Simple epistemic planning: generalised gossiping

The gossip problem, in which information (known as secrets) must be shar...
research
02/13/2022

Reduced-Form Allocations with Complementarity: A 2-Person Case

We investigate the implementation of reduced-form allocation probabiliti...

Please sign up or login with your details

Forgot password? Click here to reset