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…

ORCHID introduces a novel, bio-inspired consensus protocol that uses quantum-noisy phase oscillators and a binding threshold derived from neuroscience to achieve scalable, high-fidelity consensus in d…

This paper proposes improvements to rotating-leader consensus protocols and their underlying P2P networks in blockchain systems, achieving up to 7.26x peak throughput improvement.

The paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework that enables stable, scalable consensus control for large swarms of quadcopters using only local neighbo…

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

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

The paper proposes a scalable, distributed approach for constrained Multi-Agent Reinforcement Learning by using local consensus over dual variables to ensure global constraint satisfaction without cen…

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…

This paper proposes TRM-Raft, a Byzantine-resistant enhancement for Raft consensus that integrates a Blockchain-based Trust and Reputation Model to prevent election forgery and log tampering.

This paper proposes a reconfiguration framework called Beware to improve Byzantine fault-tolerant state-machine replication in blockchain systems.

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…

BFTide is a protocol adaptation architecture that enables a BFT system to switch between different protocols based on network conditions.

This paper presents an epistemic logic framework for studying randomized algorithms in distributed computation.

This paper investigates how network perturbations can alter the asymptotic agreement trajectory in distributed coordination systems, proving fragility in standard cooperative output regulation schemes…

A new consensus protocol, proof of verifiable delay (PoVD), is proposed to address the challenges of high computational cost and heavy communication overhead in existing consensus mechanisms.

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…

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…

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…