ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “consensus algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DCEmpiricalRecentJun 10, 2026

Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density

Niccolò D Archivio

Convergence time of 3-Majority and 2-Choices dynamics on complete graph in synchronous model

View →
math.OCcs.MAeess.SYTheoreticalRecentJun 18, 2026

Semiglobal Input-Delay Tolerance Algorithm for Distributed Nonconvex Optimization of Networked Nonlinear Systems

Jing-Zhe Xu, Zhi-Wei Liu, Ming-Feng Ge, Yan-Wu Wang +1 more

A new algorithm is developed for distributed optimization in networked nonlinear systems with input delays and consensus constraints.

View →
cs.GTcs.DCcs.MAEmpiricalRecentJul 31, 2026

Beyond Byzantine: An Organizational Consensus Algorithm for Self-Interested Agents Under Information Asymmetry

Jiawei Zhang, Jianbo Liu

This paper introduces the Organizational Consensus Algorithm (OCA) for internal negotiation and decision coordination in organizational structures, modeling inter-departmental conflict as a dynamic ga…

View →
cs.DCTheoreticalRecentJul 27, 2026

Consensus In Asynchrony: Strictly Formal

Ivan Klianev

The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…

View →
cs.DCTheoreticalRecentJul 9, 2026

Self-Stabilizing Algorithms in the Uniform Port Model

Liam Brinker, Yuval Emek, Oren Louidor

This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

View →
eess.SYcs.MATheoreticalRecentJun 24, 2026

Robustness and Leadership in Markov-switching Consensus Networks

Sarah H. Cen, Vaibhav Srivastava, Naomi Ehrich Leonard

This paper investigates how time-varying interactions impact the robustness of multi-agent dynamics in both continuous- and discrete-time settings.

View →
cs.ROEmpiricalRecentJul 1, 2026

Technical Report: Asynchronous Distributed Trajectory Estimation of Multi-Robot Systems

Adam Pooley, Matthew Hale

Proposed an asynchronous block coordinate descent algorithm for distributed trajectory estimation in robotics, reducing communications by up to 96.9% and achieving exponential convergence.

View →
cs.AIRecentMay 27, 2026

Beyond Consensus: Trace-Level Synthesis in Mixture of Agents

Shreyas Fadnavis, Praitayini Kanakaraj, Felix Wyss

The paper proposes using an LLM aggregator that analyzes complete reasoning traces, demonstrating that trace-level synthesis is superior to traditional consensus methods like majority voting for solvi…

View →
cs.LGcs.MAEmpiricalRecentJul 22, 2026

Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference

Yehuda Rudin, Osnat Keren, Michal Yemini, Alexander Fish

This paper proposes a decentralized collaborative learning paradigm for Tsetlin Machines using consensus-based inference, allowing heterogeneous agents to maintain their own private models and combine…

View →
eess.SYcs.MAcs.ROTheoreticalRecentJun 15, 2026

Distributed Safe Consensus Under Asymmetric Input and Time-Varying Output Constraints

Abhinav Sinha, Shashi Ranjan Kumar

This paper proposes a distributed consensus algorithm for multi-agent systems with asymmetric actuator constraints and output safety constraints.

View →
cs.DCTheoreticalRecentJun 22, 2026

Solving Approximate Agreement on continuous and discrete spaces

Augustin Albert, Sergio Rajsbaum

This paper studies the wait-free solvability of approximate agreement among asynchronous processes with shared read-write registers.

View →
stat.MLcs.LGmath.STTheoreticalRecentJun 11, 2026

Majority-of-Three is Optimal

Divit Rawal, Nikita Zhivotovskiy

The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.

View →
cs.CRcs.DCTheoreticalRecentJun 16, 2026

Gatling: Rapid-Fire Consensus from Parallel Composition

Giulia Scaffino, Max Resnick, Joachim Neu

Gatling is a new atomic broadcast protocol that achieves arbitrarily small inter-proposal times, even smaller than the network delay, by running multiple parallel instances of a black-box atomic broad…

View →
cs.LGcs.DCcs.MATheoreticalRecentJul 17, 2026

The Honest Quorum Problem: Epistemic Byzantine Fault Tolerance for Agentic Infrastructure

Jun He, Deying Yu

This paper introduces Epistemic Byzantine Fault Tolerance (EBFT), a fault-tolerance model for agentic infrastructure and post-deterministic distributed systems, addressing the Honest Quorum Problem an…

View →