arXiv (All)
open access
Reputation-Based Byzantine-Resilient Vector Consensus without Prespecified Fault Bounds
This paper proposes an adaptive reputation-based algorithm for Byzantine-resilient vector consensus in distributed multi-agent systems. The proposed algorithm does not require a prespecified bound on the number of Byzantine neighbors as an algorithmic input. Instead, each agent evaluates neighboring
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robust Mechanism Design on Networks with Externalities#1130749
- Beyond Byzantine: An Organizational Consensus Algorithm for Self-Interested Agents Under Information Asymmetry#422227
- Impossibility of Distributed Consensus with One Faulty Process#326668
- ProxiCBO: A Provably Convergent Consensus-Based Method for Composite Optimization#1117365
- Mitigating Front-Running Attacks through Fair and Resilient Transaction Dissemination#1051117
Record · ID 1014698
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive