Parameter-independent Iterative Approximate Byzantine Consensus
arXiv:1208.4867
Abstract
In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f.