Two-agent approximate agreement from an epistemic logic perspective

Jeremy Ledent, Sergio Rajsbaum, Jorge Armenta-Segura

Research output: Contribution to conferencePaperpeer-review

1 Downloads (Pure)

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.
Original languageEnglish
Publication statusPublished - 10 Dec 2020
EventThirteenth Latin American Workshop on New Methods of Reasoning 2020 -
Duration: 10 Dec 202011 Dec 2020

Workshop

WorkshopThirteenth Latin American Workshop on New Methods of Reasoning 2020
Abbreviated titleLANMR 2020
Period10/12/2011/12/20

Keywords

  • epistemic logic
  • approximate consensus
  • distributed computing
  • simplicial complexes

Fingerprint

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

Cite this