Byzantine Preferential Voting

by   Darya Melnyk, et al.

In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on preferences, which is an important question in social choice theory, complements already known results from Byzantine agreement. In addition preferential voting raises new questions about how to approximate consensus vectors. We propose a deterministic algorithm to solve Byzantine agreement on rankings under a generalized validity condition, which we call Pareto-Validity. These results are then extended by considering a special voting rule which chooses the Kemeny median as the consensus vector. For this rule, we derive a lower bound on the approximation ratio of the Kemeny median that can be guaranteed by any deterministic algorithm. We then provide an algorithm matching this lower bound. To our knowledge, this is the first non-trivial multi-dimensional approach which can tolerate a constant fraction of Byzantine nodes.



page 1

page 2

page 3

page 4


Multidimensional Byzantine Agreement in a Synchronous Setting

In this paper we will present the Multidimensional Byzantine Agreement (...

Byzantine Agreement with Unknown Participants and Failures

A set of mutually distrusting participants that want to agree on a commo...

Fair Byzantine Agreements for Blockchains

Byzantine general problem is the core problem of the consensus algorithm...

Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement

Lower bounds and impossibility results in distributed computing are both...

Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems

We give an introduction to federated Byzantine agreement systems (FBAS) ...

Swarm consensus

The strength of gnomes lies in their coordinated action. Being small and...

Centrality of nodes in Federated Byzantine Agreement Systems

The federated Byzantine agreement system (FBAS) is a consensus model int...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.