Two-agent approximate agreement from an epistemic logic perspective

Jorge Armenta-Segura, Jeremy Ledent, Sergio Rajsbaum

Research output: Contribution to journalArticlepeer-review

13 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)769-785
Number of pages17
JournalComputación y Sistemas
Issue number2
Publication statusPublished - 30 Jun 2022


  • approximate consensus
  • distributed algorithm
  • epistemic logic
  • fault-tolerance


Dive into the research topics of 'Two-agent approximate agreement from an epistemic logic perspective'. Together they form a unique fingerprint.

Cite this