In this work, we follow the line of fault-tolerant algorithms for multi-agent systems. Suppose that the infected agents follow the so-called malicious adversary model. The infected agents may lose their original state values and broadcast their corrupted values. The goal for other non-infected agents is to reach consensus at a safe value, within the range of the original values of the non-infectious agents. Moreover, our results are motivated by the class of Mean Subsequence Reduced (MSR) algorithms, which has been studied in [1]}, [2]}, [3]}. In such algorithms, the non-infected agents ignore suspicious values from their neighbors. Such algorithms do not need to detect the adversarial neighbors, but require a certain level of connectivity in the network.
