Resumen

ARMENTA-SEGURA, Jorge; LEDENT, Jeremy  y  RAJSBAUM, Sergio. Two-agent Approximate Agreement from an Epistemic Logic Perspective. Comp. y Sist. [online]. 2022, vol.26, n.2, pp.769-785.  Epub 10-Mar-2023. ISSN 2007-9737.  https://doi.org/10.13053/cys-26-2-4234.

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.

Palabras llave : Distributed algorithm; approximate consensus; fault-tolerance; epistemic logic.

        · texto en Inglés     · Inglés ( pdf )