Two-agent approximate agreement from an epistemic logic perspective

Jorge Armenta-Segura; Jeremy Ledent; Sergio Rajsbaum

doi:10.13053/CyS-26-2-4234

Two-agent approximate agreement from an epistemic logic perspective

Jorge Armenta-Segura^*, Jeremy Ledent, Sergio Rajsbaum

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

18 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³ 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 language	English
Pages (from-to)	769-785
Number of pages	17
Journal	Computación y Sistemas
Volume	26
Issue number	2
DOIs	https://doi.org/10.13053/CyS-26-2-4234
Publication status	Published - 30 Jun 2022

Keywords

approximate consensus
distributed algorithm
epistemic logic
fault-tolerance

Access to Document

10.13053/CyS-26-2-4234Licence: CC BY-NC-ND 4.0

Armenta-Segura-etal-CyS-2022-Two-agent-approximate-agreement-from-an-epistemic-logic-perspectiveFinal published version, 580 KBLicence: CC BY-NC-ND 4.0

Cite this

@article{4a78f88bc39e4e0a8674aa438b89b106,

title = "Two-agent approximate agreement from an epistemic logic perspective",

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.",

keywords = "approximate consensus, distributed algorithm, epistemic logic, fault-tolerance",

author = "Jorge Armenta-Segura and Jeremy Ledent and Sergio Rajsbaum",

year = "2022",

month = jun,

day = "30",

doi = "10.13053/CyS-26-2-4234",

language = "English",

volume = "26",

pages = "769--785",

journal = "Computaci{\'o}n y Sistemas",

issn = "1405-5546",

publisher = "Centro de Investigacion en Computacion (CIC) del Instituto Politecnico Nacional (IPN)",

number = "2",

}

TY - JOUR

T1 - Two-agent approximate agreement from an epistemic logic perspective

AU - Armenta-Segura, Jorge

AU - Ledent, Jeremy

AU - Rajsbaum, Sergio

PY - 2022/6/30

Y1 - 2022/6/30

N2 - 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.

AB - 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.

KW - approximate consensus

KW - distributed algorithm

KW - epistemic logic

KW - fault-tolerance

U2 - 10.13053/CyS-26-2-4234

DO - 10.13053/CyS-26-2-4234

M3 - Article

AN - SCOPUS:85135759309

SN - 1405-5546

VL - 26

SP - 769

EP - 785

JO - Computación y Sistemas

JF - Computación y Sistemas

IS - 2

ER -

Two-agent approximate agreement from an epistemic logic perspective

Abstract

Keywords

Access to Document

Fingerprint

Cite this