Reaching Agreement Among k out of n Processes

Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In agreement problems, each process has an input value and must choose a decision (output) value. Given n≥2 processes and m≥2 possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes in the presence of t crash failures. Without communication, when each process simply decides on its input value, at least ⌈(n-t)/m⌉ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example, when m=2, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings
EditorsYuval Emek
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages18
ISBN (Print)9783031606021
StatePublished - 2024
Externally publishedYes
Event31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024 - Vietri sul Mare, Italy
Duration: 27 May 202429 May 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14662 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024
CityVietri sul Mare

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.


  • Message passing
  • Partial agreement
  • Shared Memory


Dive into the research topics of 'Reaching Agreement Among k out of n Processes'. Together they form a unique fingerprint.

Cite this