The Step Complexity of Multidimensional Approximate Agreement

Approximate agreement allows a set of n processes to obtain outputs that are within a specified distance ϵ > 0 of one another and within the convex hull of the inputs. When the inputs are real numbers, there is a wait-free shared-memory approximate agreement algorithm [16] whose step complexity is in O(n log(S/ϵ)), where S, the spread of the inputs, is the maximal distance between inputs. There is another wait-free algorithm [17] that avoids the dependence on n and achieves O(log(M/ϵ)) step complexity where M, the magnitude of the inputs, is the absolute value of the maximal input. This paper considers whether it is possible to obtain an approximate agreement algorithm whose step complexity depends on neither n nor the magnitude of the inputs, which can be much larger than their spread. On the negative side, we prove that Ω (Equation presented) is a lower bound on the step complexity of approximate agreement, even when the inputs are real numbers. On the positive side, we prove that a polylogarithmic dependence on n and S/ϵ can be achieved, by presenting an approximate agreement algorithm with O(log n(log n + log(S/ϵ))) step complexity. Our algorithm works for multidimensional domains. The step complexity can be further restricted to be in O(min{log n(log n + log(S/ϵ)), log(M/ϵ)}) when the inputs are real numbers.