Byzantine Approximate Agreement on GraphsByzantine Approximate Agreement on Graphs • November 20th, 2019
Abstract. Consider a distributed system with n processors out of which f can be Byzantine faulty. In the approximate agreement task, each processor i receives an input value xi and has to decide on an output value yi such that
