Two-Agent Approximate Agreement from an Epistemic Logic Perspective

Jorge Armenta-Segura, Jeremy Ledent, Sergio Rajsbaum


We investigate the two agents approximate agreement problem in a dynamic network in which topology may change unpredictably, and where consensus is not solvable. It is known that the number of rounds necessary and sufficient to guarantee that the two agents output values 1/k3 away from each other is k. We distil ideas from previous papers to provide a self-contained, elementary introduction, that explains this result from the epistemic logic perspective.


Distributed algorithm, approximate consensus, fault-tolerance, epistemic logic

Full Text: PDF