… In this section we discuss preference profiles that are vulnerable to Byzantine nodes. The
first case is based on reducing the rankings to binary agreement and gives the highest …

… centralized voting mechanism is not feasible. Thus, we study the Byzantine voting problem
… that it is possible to design Byzantine voting algorithms that produce the voting output in one …

… Byzantine voters trying to deteriorate the ranking. We consider a stronglyadversarial scenario
where the Byzantine voters know the BTL scores, the votes … all Byzantine voters voting the …

As Byzantine Agreement (BA) protocols find application in large-scale decentralized
cryptocurrencies, an increasingly important problem is to design BA protocols with improved …

… digital communities is threatened by Byzantines therein. Most existing works focused on
Byzantine detection, but we are interested in growing Byzantineresilient community rather than …

… rationing voting in traditional one-person, one-vote mechanisms (" … voters can express their
preference by acquiring extra votes. To link the number of votes and the intensity of QV voters…

… Taken together, we obtain a new protocol for Byzantine agreement that is … vote expresses
Pi's preference for b based on evidence for preference b in round r - 1, whereas a soft pre-vote …

… of Byzantine voters). As it is impossible to distinguish a non-responsive Byzantine voter from
a … ID Hill, “To advance the understanding of preferential voting system - notes on the droop …

… to be preference rankings of three or more candidates. This so-called preferential voting
raises … At first, a deterministic algorithm to solve Byzantine agreement on rankings is proposed …

… We consider arbitrary (Byzantine) failures, because we expect our system to be deployed
across separate administrative domains. For each of the subsystems, we have the following …