MinMax algorithms for stabilizing consensus

DOI10.1007/s00446-021-00392-9OpenAlexW3156249133MaRDI QIDQ1981802

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)

Related Items (2)

Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Synchronization modulo \(P\) in dynamic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Defining liveness
• A characterization of oblivious message adversaries for which consensus is solvable
• The Heard-Of model: computing in distributed systems with benign faults
• Convergence Speed in Distributed Consensus and Averaging
• The Firing Squad Problem Revisited.
• Convergence to Consensus by General Averaging
• Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Stabilizing Consensus with Many Opinions
• Consensus and Cooperation in Networked Multi-Agent Systems
• Time is not a healer
• Closed schedulers: a novel technique for analyzing asynchronous protocols
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Stability of multiagent systems with time-dependent communication links

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