Two-agent approximate agreement from an epistemic logic perspective

Ledent, Jeremy and Rajsbaum, Sergio and Armenta-Segura, Jorge (2020) Two-agent approximate agreement from an epistemic logic perspective. In: Thirteenth Latin American Workshop on New Methods of Reasoning 2020, 2020-12-10 - 2020-12-11.

[thumbnail of Ledent-etal-LANMR-2020-Two-agent-approximate-agreement-from-an-epistemic-logic]
Preview
 Text. Filename: Ledent_etal_LANMR_2020_Two_agent_approximate_agreement_from_an_epistemic_logic.pdf
Accepted Author Manuscript
Download (540kB)| 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/k^3 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

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