MinMax algorithms for stabilizing consensus

DOI10.1007/S00446-021-00392-9MaRDI QIDQ1981802zbMATH OpenOpenAlexFDO

Authors Bernadette Charron-Bost, Shlomo Moran

Publication date 6 September 2021

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.09073

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Convergence of max-min consensus algorithms
• Consensus Algorithms and the Decomposition-Separation Theorem
• On the minimal synchronism needed for distributed consensus
• Cutoff bounds for consensus algorithms
• Efficient algorithms for the consensus decision problem
• Minimal synchrony for Byzantine consensus
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Improved fixed-parameter algorithms for minimum-flip consensus trees
• Round-Oblivious Stabilizing Consensus in Dynamic Networks

Cites work

• A characterization of oblivious message adversaries for which consensus is solvable
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Closed schedulers: a novel technique for analyzing asynchronous protocols
• Consensus and Cooperation in Networked Multi-Agent Systems
• Convergence speed in distributed consensus and averaging
• Convergence to consensus by general averaging
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Defining liveness
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Stability of multiagent systems with time-dependent communication links
• Stabilizing Consensus with Many Opinions
• The firing squad problem revisited
• The Heard-Of model: computing in distributed systems with benign faults
• Time is not a healer (preliminary version)

Cited in

(7)

• Consensus mechanism with maximum-return modifications and minimum-cost feedback: a perspective of game theory
• Synchronization modulo P in dynamic networks
• A self-stabilizing quorum-based protocol for maxima computing
• Synchronous \(t\)-resilient consensus in arbitrary graphs
• Round-Oblivious Stabilizing Consensus in Dynamic Networks
• A topological characterization of stabilizing consensus
• Convergence of max-min consensus algorithms

This page was built for publication: MinMax algorithms for stabilizing consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1981802)