Power indices of simple games and vector-weighted majority games by means of binary decision diagrams

DOI10.1016/j.ejor.2010.09.020zbMath1210.91012OpenAlexW2015247315MaRDI QIDQ531446

Stefan Bolus

Publication date: 29 April 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.020

zbMATH Keywords

threshold functionsimple gamebinary decision diagramvector-weighted majority game

Mathematics Subject Classification ID

Cooperative games (91A12) (n)-person games, (n>2) (91A06) Voting theory (91B12) Decision theory for games (91A35)

Related Items (15)

Cooperation through social influence ⋮ Implicit power indices for measuring indirect control in corporate structures ⋮ Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation ⋮ Computing and visualizing Banks sets of dominance relations using relation algebra and RelView ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ On the use of binary decision diagrams for solving problems on simple games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ A relation-algebraic approach to simple games ⋮ Unnamed Item ⋮ Dynamic programming algorithms for computing power indices in weighted multi-tier games ⋮ On the enumeration of bipartite simple games ⋮ A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria ⋮ Set-weighted games and their application to the cover problem ⋮ Monte Carlo methods for the Shapley-Shubik power index ⋮ Computation of several power indices by generating functions

Uses Software

• azove

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating functions for coalitional power indices: an application to the IMF
• On threshold BDDs and the optimal variable ordering problem
• Weighted multiple majority games with unions: generating functions and applications to the European Union
• A new index of power for simple n-person games
• Modification of the Banzhaf value for games with a coalition structure
• Faster algorithms for computing power indices in weighted voting games
• Quasi-weightings, trading, and desirability relations in simple games
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Branching Programs and Binary Decision Diagrams
• Efficient Computation of Power Indices for Weighted Majority Games
• Introduction to the Theory of Cooperative Games
• Generating functions for computing power indices efficiently
• NP-completeness for calculating power indices of weighted majority games

This page was built for publication: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams