LS Penrose was the first to propose a measure of voting power (which later came to be known as ‘the [absolute] Banzhaf index’). His limit theorem – which is implicit in Penrose (1952) and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely while the quota is pegged at half the total weight, then – under certain conditi...

In this work we propose a novel geometric clustering algorithm based on the Tensor Voting Framework (TVF). More precisely, we propose the construction of a weighted graph by means of the information diffused by TVF during the vote casting step. This graph, which summarizes informations related to the manifold geometric structure, was used for clustering purposes. To this aim, we applied the wel...

k-Nearest Neighbor (k-NN) is one of the classification algorithms which becomes top 10 in data mining. k-NN simple and easy to apply. However, results are greatly influenced by scale input. All its attributes considered equally important Euclidean distance, but inappropriate with relevance each attribute. Thus, it makes decreased. Some more or less or, fact, irrelevant determining results. To o...

This paper discusses weighted voting games and two methods of manipulating those games, called annexation and merging. These manipulations allow either an agent, called an annexer to take over the voting weights of some other agents in the game, or the coming together of some agents to form a bloc of manipulators to have more power over the outcomes of the games. We evaluate the extent of susce...

We propose a generic model for the “weighted voting” aggregation step performed by several methods in supervised classification. Further, we construct an algorithm to enumerate the number of distinct aggregate classifiers that arise in this model. When there are only two classes in the classification problem, we show that a class of functions that arises from aggregate classifiers coincides wit...

Voting is an important operation in multichannel computation paradigm and realization of ultrareliable and real-time control systems that arbitrates among the results of N redundant variants. These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems based on N-version programming (NVP). Depending on the characteristics of the application and the ty...

Organizations often distribute resources through weighted voting. We analyze this setting using a noncooperative bargaining game based on the Baron-Ferejohn (1989) model. Unlike analyses derived from cooperative game theory, we find that each voter’s expected payoff is proportional to her voting weight. An exception occurs when many high-weight voters exist, as low-weight voters may expect disp...

Agreement algorithms can be categorized in different ways. One categorization of such algorithms is based on whether the final decisions are exact or inexact. In inexact algorithms, also known as approximate agreement algorithms, each node produces its final decision that may not be necessarily the exact same decision value produced by a different non-faulty node. Most studies on such algorithm...