Spatial power indices with applications on real voting data from the Chamber of Deputies of the Czech Parliament

2015 ◽  
Vol 24 (2) ◽  
pp. 407-420 ◽  
Author(s):  
Elena Mielcová
Keyword(s):  
Power Indices ◽  
Chamber Of Deputies

Using equations from power indices to analyze figure skating teams

Public Choice ◽  
2017 ◽  
Vol 170 (3-4) ◽  
pp. 231-251 ◽  
Author(s):  
Diana Cheng ◽  
Peter Coughlin
Keyword(s):  
Power Indices ◽  
Figure Skating

Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions

Games ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 6
Author(s):  
Jochen Staudacher ◽  
Felix Wagner ◽  
Jan Filipp
Keyword(s):  
Dynamic Programming ◽  
Power Indices ◽  
Efficient Computation ◽  
Banzhaf Index ◽  
Weighted Voting ◽  
Computing Power ◽  
Weighted Voting Games ◽  
Voting Games ◽  
Large Numbers ◽  
New Algorithms

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley–Shubik indices for weighted voting games, we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e., the Owen index, the Banzhaf–Owen index and the symmetric coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times, as well as storage requirements.

Sign in / Sign up

Export Citation Format

Share Document