Two-agent approximate agreement from an epistemic logic perspective

Jeremy Ledent; Sergio Rajsbaum; Jorge Armenta-Segura

Two-agent approximate agreement from an epistemic logic perspective

Jeremy Ledent, Sergio Rajsbaum, Jorge Armenta-Segura

Research output: Contribution to conference › Paper › peer-review

20 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 language	English
Publication status	Published - 10 Dec 2020
Event	Thirteenth Latin American Workshop on New Methods of Reasoning 2020 - Duration: 10 Dec 2020 → 11 Dec 2020

Workshop

Workshop	Thirteenth Latin American Workshop on New Methods of Reasoning 2020
Abbreviated title	LANMR 2020
Period	10/12/20 → 11/12/20

Keywords

epistemic logic
approximate consensus
distributed computing
simplicial complexes

Access to Document

Ledent-etal-LANMR-2020-Two-agent-approximate-agreement-from-an-epistemic-logicAccepted author manuscript, 528 KB

Cite this

@conference{088b338475034b5aa6fa444d480ce567,

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

keywords = "epistemic logic, approximate consensus, distributed computing, simplicial complexes",

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

year = "2020",

month = dec,

day = "10",

language = "English",

note = "Thirteenth Latin American Workshop on New Methods of Reasoning 2020, LANMR 2020 ; Conference date: 10-12-2020 Through 11-12-2020",

}

TY - CONF

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

AU - Ledent, Jeremy

AU - Rajsbaum, Sergio

AU - Armenta-Segura, Jorge

PY - 2020/12/10

Y1 - 2020/12/10

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

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

KW - epistemic logic

KW - approximate consensus

KW - distributed computing

KW - simplicial complexes

UR - http://www.lanmr.unam.mx/proceedings.html

M3 - Paper

T2 - Thirteenth Latin American Workshop on New Methods of Reasoning 2020

Y2 - 10 December 2020 through 11 December 2020

ER -

Two-agent approximate agreement from an epistemic logic perspective

Abstract

Workshop

Keywords

Access to Document

Other files and links

Fingerprint

Cite this