Dynamic programming algorithms for computing power indices in weighted multi-tier games

DOI10.1016/j.mathsocsci.2020.06.004zbMath1505.91048OpenAlexW3036575477MaRDI QIDQ2019337

Ingo Wilms

Publication date: 26 April 2021

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2020.06.004

zbMATH Keywords

dynamic programmingbinary decision diagrampower indicesShapley-Shubik indexBanzhaf index

Mathematics Subject Classification ID

Cooperative games (91A12) Voting theory (91B12) Dynamic programming (90C39)

Cites Work

• A three-dimensional voting system in Hong Kong
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Assessing success and decisiveness in voting situations
• The distribution of power in the European constitution
• On the existence of a minimum integer representation for weighted voting systems
• Weighted multiple majority games with unions: generating functions and applications to the European Union
• Weighted voting, multicameral representation, and power
• A new index of power for simple n-person games
• Computing power indices in weighted multiple majority games.
• Three-valued simple games
• On the characterization of weighted simple games
• An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
• Graph-Based Algorithms for Boolean Function Manipulation
• Efficient Computation of Power Indices for Weighted Majority Games
• Multilinear Extensions of Games
• On the Theory of Dynamic Programming
• Generating functions for computing power indices efficiently
• Unnamed Item