We examine agent failures in weighted voting games. In our cooperative game model, R-WVG, each agent has a weight and a survival probability, and the value of an agent coalition is the probability that its surviving members would have a total weight exceeding a threshold. We propose algorithms for computing the value of a coalition, finding stable payoff allocations, and estimating the power of...

In this paper, we provide an algorithm to compute the equilibrium payoffs in the coalitional bargaining model of Eraslan-McLennan (Journal of Economic Theory, 2013) by using recent developments in methods of numerical algebraic geometry. The Eraslan-McLennan model is a legislative bargaining model that studies weighted voting games with players that are potentially heterogeneous in probabilitie...

The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is independent of the particular region in which the example to be classified falls. Methods using weighted voting schemes only partly alleviate these problems, since they still involve choosing a fixed k. In this paper, a n...

Weighted voting games (WVG) are coalitional games in which an agent’s contribution to a coalition is given by his weight, and a coalition wins if its total weight meets or exceeds a given quota. These games model decision-making in political bodies as well as collaboration and surplus division in multiagent domains. The computational complexity of various solution concepts for weighted voting g...

With the growth of technology, supervising systems are increasingly replacing humans in military, transportation, medical, spatial, and other industries. Among these systems are machine vision systems which are based on image processing and analysis. One of the important tasks of image processing is classification of images into desirable categories for the identification of objects or their sp...

Voting is used in realizing ultrareliable systems based on multichannel computation. In practical applications to date, the multiple computation channels have consisted of identical hardware circuits, which are expected to produce the same outputs, or diverse software modules, which may produce inexact or incomplete results. The challenge in hardware voting is the choice of adjudication points ...

with the growth of technology, supervising systems are increasingly replacing humans in military, transportation, medical, spatial, and other industries. among these systems are machine vision systems which are based on image processing and analysis. one of the important tasks of image processing is classification of images into desirable categories for the identification of objects or their sp...

Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can contribute), and a coalition of agents wins if its total weight meets or exceeds a given threshold. Even though coalitional stability in such games is important, existing research has nonetheless only considered the stability of ...

For some applications of k-nearest neighbor classiiers, the best results are obtained at a relatively large value of k. With the majority voting method, these results can be suboptimal. In this paper the performance of various weighted voting methods is tested on a number of machine learning datasets. The results show that weighted voting is often superior to majority voting, and that the linea...

Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be winning if the sum of weights of agents in that coalition meets some stated threshold. We study a natural generalisation of weighted voting games called Boolean Weighted Voting Games (BWVGs). BWVGs are intended to mode...