Average consensus plays a key role in distributed networks, with applications ranging from time synchronization, information fusion, load balancing, to decentralized control. Existing average algorithms require individual agents exchange explicit state values their neighbors, which leads the undesirable disclosure of sensitive state. In this paper, we propose novel algorithm for time-varying di...

This paper introduces a new model for consensus called federated Byzantine agreement (FBA). FBA achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums. Slices bind the system together much the way individual networks’ peering and transit decisions now unify the Internet. We also present the Stellar Consensus Protocol (...

Assuming a linguistic framework, a model for the consensus reaching problem in heterogeneous group decision making is proposed. This model contains two types of linguistic consensus measures: linguistic consensus degrees and linguistic proximities to guide the consensus reaching process. These measures evaluate the current consensus state in three levels of action: level of the pairs of alterna...

The group decision making process usually contains a consensus model which focuses on achieving some level of agreement amongst experts before their preferences are aggregated and an alternative is chosen. These consensus models look at the distances between the experts’ preferences and use this to provide each expert with a consensus level. If an expert’s consensus level is below a predefined ...