In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcome of such a decision. Weighted voting games are often used to deal with these situations. The amount of influence that an agent has in a weighted voting game can be measured by means of various power indices. This pape...

Distributed voting is an important problem in reliable computing. In an N Modular Redundant (NMR) system, the N computational modules execute identical tasks and they need to periodically vote on their current states. In this paper, we propose a deterministic majority voting algorithm for NMR systems. Our voting algorithm uses error-correcting codes to drastically reduce the average case commun...

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...

We present an online voting architecture based on partitioning the election in small clusters of voters and using a new Multi-party Computation algorithm for obtaining voting results from the clusters. This new algorithm has some practical advantages over other previously known algorithms and isn’t bound to any specific cryptographic concept; so it can be adapted to future cryptographic exigenc...

There are several consistency control algorithms for managing replicated files in the face of network partitioning due to site or communication link failures. In this paper, we consider the popular voting scheme along with three enhancements: voting with a primary site, dynamic voting, and dynamic voting with linearly ordered copiee. We develop a stochastic model which compares the file availab...

The Timed-Buffer Distributed Voting Algorithm (TB-DVA), a secure distributed voting protocol, is introduced and described. A formal specification of the algorithm is developed using Lamport’s specification language TLA+. Then strategies for proving the correctness of the specification using Lamport’s Temporal Logic of Actions (TLA) are discussed.

For f a weighted voting scheme used by n voters to choose between two candidates, the n Shapley-Shubik Indices (or Shapley values) of f provide a measure of how much control each voter can exert over the overall outcome of the vote. Shapley-Shubik indices were introduced by Lloyd Shapley and Martin Shubik in 1954 [SS54] and are widely studied in social choice theory as a measure of the “influen...

Sum& Conclusions Voting is important in the realization of ultrareliable systems based on the multi-channel computation paradigm. In an earlier paper (1991 Aug) I dealt with voting networks, viz, hardware implementation of certain voting schemes. A voting algorithm specifies how the voting result is obtained from the input data and can be the basis for implementing a hardware voting network or ...

The Gibbs classiier is a simple approximation to the Bayesian optimal classiier in which one samples from the posterior for the parameter , and then classiies using the single classiier indexed by that parameter vector. In this paper, we study the Voting Gibbs classiier, which is the extension of this scheme to the full Monte Carlo setting, in which N samples are drawn from the posterior and ne...