Two-Agent Approximate Agreement from an Epistemic Logic Perspective

Authors

  • Jorge Armenta-Segura Universidad Nacional Autónoma de México
  • Jeremy Ledent University of Strathclyde
  • Sergio Rajsbaum Universidad Nacional Autónoma de México

DOI:

https://doi.org/10.13053/cys-26-2-4234

Keywords:

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

Abstract

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.

Downloads

Published

2022-06-15