English
Related papers

Related papers: Power Indices and minimal winning Coalitions

200 papers

Weighted voting is a classic model of cooperation among agents in decision-making domains. In such games, each player has a weight, and a coalition of players wins the game if its total weight meets or exceeds a given quota. A players power…

Computer Science and Game Theory · Computer Science 2014-01-17 Haris Aziz , Yoram Bachrach , Edith Elkind , Mike Paterson

In social network analysis, there is a common perception that influence is relevant to determine the global behavior of the society and thus it can be used to enforce cooperation by targeting an adequate initial set of individuals or to…

Computer Science and Game Theory · Computer Science 2013-07-01 Xavier Molinero , Fabián Riquelme , Maria Serna

Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class of simple games is notably well suited to study the…

Computer Science and Game Theory · Computer Science 2022-01-25 Gianlorenzo D'Angelo , Esmaeil Delfaraz , Hugo Gilbert

The Banzhaf Power Index (BPI) is a method of measuring the power of voters in determining the outcome of a voting game. Some voting games exhibit a hierarchical structure, including the US electoral college and ensemble learning methods; we…

Computer Science and Game Theory · Computer Science 2025-01-14 John Randolph , Denizalp Goktas , Amy Greenwald

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…

Combinatorics · Mathematics 2015-05-14 Josep Freixas , Sascha Kurz

Weighted voting games apply to a wide variety of multi-agent settings. They enable the formalization of power indices which quantify the coalitional power of players. We take a novel approach to the study of the power of big vs.~small…

Computer Science and Game Theory · Computer Science 2021-09-28 Yotam Gafni , Ron Lavi , Moshe Tennenholtz

We exhibit the hidden beauty of weighted voting and voting power by applying a generalization of the Penrose-Banzhaf index to social choice rules. Three players who have multiple votes in a committee decide between three options by…

Computer Science and Game Theory · Computer Science 2022-08-01 Sascha Kurz , Alexander Mayer , Stefan Napel

The Shapley-Shubik index was designed to evaluate the power distribution in committee systems drawing binary decisions and is one of the most established power indices. It was generalized to decisions with more than two levels of approval…

Computer Science and Game Theory · Computer Science 2019-07-03 Sascha Kurz , Issofa Moyouwou , Hilaire Touyem

Weighted voting games are a family of cooperative games, typically used to model voting situations where a number of agents (players) vote against or for a proposal. In such games, a proposal is accepted if an appropriately weighted sum of…

Computer Science and Game Theory · Computer Science 2019-01-01 Ilias Diakonikolas , Chrystalla Pavlou

This paper employs switching-algebraic techniques for the calculation of a fundamental index of voting powers, namely, the total Banzhaf power. This calculation involves two distinct operations: (a) Boolean differencing or differentiation,…

Logic in Computer Science · Computer Science 2023-06-14 Ali Muhammad Rushdi , Muhammad Ali Rushdi

We introduce a new simple game, which is referred to as the complementary weighted multiple majority game (C-WMMG for short). C-WMMG models a basic cooperation rule, the complementary cooperation rule, and can be taken as a sister model of…

Computer Science and Game Theory · Computer Science 2013-01-04 Zhigang Cao , Xiaoguang Yang

Feature attribution methods have become essential for explaining machine learning models. Many popular approaches, such as SHAP and Banzhaf values, are grounded in power indices from cooperative game theory, which measure the contribution…

Machine Learning · Computer Science 2025-01-07 P. Barceló , R. Cominetti , M. Morgado

For $f$ a weighted voting scheme used by $n$ voters to choose between two candidates, the $n$ \emph{Shapley-Shubik Indices} (or {\em Shapley values}) of $f$ provide a measure of how much control each voter can exert over the overall outcome…

Computer Science and Game Theory · Computer Science 2012-12-21 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

Decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game. Influence of a member is then measured by a power index. A large variety of different indices has been introduced in the literature. This…

Computer Science and Game Theory · Computer Science 2018-05-08 Sascha Kurz

An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games…

Computer Science and Game Theory · Computer Science 2009-05-21 Haris Aziz , Mike Paterson

The Shapley-Shubik index is a specialization of the Shapley value and is widely applied to evaluate the power distribution in committees drawing binary decisions. It was generalized to decisions with more than two levels of approval both in…

Computer Science and Game Theory · Computer Science 2020-10-09 Sascha Kurz , Issofa Moyouwou , Hilaire Touyem

We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and political organizations, where decisions are made by a majority vote…

Computer Science and Game Theory · Computer Science 2014-08-05 Joel Oren , Yuval Filmus , Yair Zick , Yoram Bachrach

A proposed measure of voting power should satisfy two conditions to be plausible: first, it must be conceptually justified, capturing the intuitive meaning of what voting power is; second, it must satisfy reasonable postulates. This paper…

Theoretical Economics · Economics 2022-05-18 Arash Abizadeh , Adrian Vetta

We investigate the distribution of the well-studied Shapley--Shubik values in weighted voting games where the agents are stochastically determined. The Shapley--Shubik value measures the voting power of an agent, in typical collective…

Computer Science and Game Theory · Computer Science 2016-01-26 Yuval Filmus , Joel Oren , Kannan Soundararajan

We study the complexity of the following problem: Given two weighted voting games G' and G'' that each contain a player p, in which of these games is p's power index value higher? We study this problem with respect to both the…

Computational Complexity · Computer Science 2008-01-31 Piotr Faliszewski , Lane A. Hemaspaandra