Two-agent approximate agreement from an epistemic logic perspective

Tools

Armenta-Segura, Jorge and Ledent, Jeremy and Rajsbaum, Sergio (2022) Two-agent approximate agreement from an epistemic logic perspective. Computación y Sistemas, 26 (2). pp. 769-785. ISSN 2007-9737 (https://doi.org/10.13053/CyS-26-2-4234)

[thumbnail of Armenta-Segura-etal-CyS-2022-Two-agent-approximate-agreement-from-an-epistemic-logic-perspective]
Preview
 Text. Filename: Armenta_Segura_etal_CyS_2022_Two_agent_approximate_agreement_from_an_epistemic_logic_perspective.pdf
Final Published Version
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (594kB)| Preview

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.

ORCID iDs

Armenta-Segura, Jorge, Ledent, Jeremy ORCID logoORCID: https://orcid.org/0000-0001-7375-4725 and Rajsbaum, Sergio;
CORE (COnnecting REpositories)