Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
From MaRDI portal
(Redirected from Publication:531446)
Recommendations
- On the use of binary decision diagrams for solving problems on simple games
- Computing power indices in weighted multiple majority games.
- NP-completeness for calculating power indices of weighted majority games
- Dynamic programming algorithms for computing power indices in weighted multi-tier games
- Efficient Computation of Power Indices for Weighted Majority Games
Cites work
- A new index of power for simple n-person games
- Binary Decision Diagrams
- Branching Programs and Binary Decision Diagrams
- Efficient Computation of Power Indices for Weighted Majority Games
- Faster algorithms for computing power indices in weighted voting games
- Generating functions for coalitional power indices: an application to the IMF
- Generating functions for computing power indices efficiently
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1555979 (Why is no real title available?)
- scientific article; zbMATH DE number 1766750 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- scientific article; zbMATH DE number 750169 (Why is no real title available?)
- scientific article; zbMATH DE number 1390338 (Why is no real title available?)
- Introduction to the Theory of Cooperative Games
- Modification of the Banzhaf value for games with a coalition structure
- NP-completeness for calculating power indices of weighted majority games
- On threshold BDDs and the optimal variable ordering problem
- Quasi-weightings, trading, and desirability relations in simple games
- Weighted multiple majority games with unions: generating functions and applications to the European Union
Cited in
(24)- Computing power indices in weighted multiple majority games.
- Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
- On the use of binary decision diagrams for solving problems on simple games
- Complementary cooperation, minimal winning coalitions, and power indices
- Dynamic programming algorithms for computing power indices in weighted multi-tier games
- On the enumeration of bipartite simple games
- Set-weighted games and their application to the cover problem
- Monte Carlo methods for the Shapley-Shubik power index
- Implicit power indices for measuring indirect control in corporate structures
- Computation of several power indices by generating functions
- Cooperation through social influence
- Dynamic programming for computing power indices for weighted voting games with precoalitions
- Complexity results for calculating power indices of weighted majority games
- scientific article; zbMATH DE number 3849010 (Why is no real title available?)
- Power Indices in Spanning Connectivity Games
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Efficient Computation of Power Indices for Weighted Majority Games
- scientific article; zbMATH DE number 7526435 (Why is no real title available?)
- A relation-algebraic approach to simple games
- On generating functions to compute some power measures for weighted majority games
- A general model for multi-parameter weighted voting games
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
- Forms of representation for simple games: sizes, conversions and equivalences
- The exact lower bound for the Coleman index of the power of a collectivity for a special class of simple majority games
This page was built for publication: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531446)
