We study the design of voting rules for committees representing heterogeneous groups (countries, states, districts) when cooperation among is voluntary. While efficiency recommends weighting proportionally to their stakes, we show that accounting participation constraints entails overweighting some groups, those which incentive cooperate lowest. When collective decisions are not enforceable, in...

Mobile and other loosely-coupled environments call for decentralized optimistic replication protocols that provide highly available access to shared objects, while ensuring eventual convergence towards a strongly consistent state. In this paper we propose a novel epidemic weighted voting protocol for achieving such goal. Epidemic weighted voting approaches eliminate the single point of failure ...

Mobile and other loosely-coupled environments call for decentralized optimistic replication protocols that provide highly available access to shared objects, while ensuring eventual convergence towards a strongly consistent state. In this paper we propose a novel epidemic weighted voting protocol for achieving such goal. Epidemic weighted voting approaches eliminate the single point of failure ...

The splitting of weights into smaller sizes by agents in a weighted voting game and the distribution of the new weights among several false identities with the intent of payoff or power increase in a new game consisting of the original agents as well as the false identities is called false name manipulation. In this paper, we study false name manipulations in weighted voting games focusing on t...

The paper presents an experimental study of solving multiclass learning problems by a method called n-classifier. This approach is based on training (n − n)/2 binary classifiers one for each pair of classes. Final decision is obtained by a weighted majority voting rule. The aim of the computational experiment is to examine the influence of the choice of a learning algorithm on a classification ...

The complexity of a computational problem is the order of computational resources which are necessary and sufficient to solve the problem. The algorithm complexity is the cost of a particular algorithm. We say that a problem has polynomial complexity if its computational complexity is a polynomial in the measure of input size. We introduce polynomial time algorithms based in generating function...

The aim of this paper is to extend the classical Banzhaf index power voting games in which players have weights representing different cooperation or bargaining abilities. obtained value does not satisfy total property, justified by imperfect cooperation. Nevertheless, it monotonous weights. We also obtain three characterizations value. Then we relate Owen multilinear extension.

We provide a new method to compute the Banzhaf power index for weighted voting games as well as weighted double and triple majority games. We calculate the Banzhaf index in an exact way by generating functions, with a signi...cant decrease in the computational complexity. Moreover, the Banzhaf indices are calculated for the decision rules approved in the Nice summit meeting, which will be used ...