Dynamic programming algorithms for computing power indices in weighted multi-tier games
From MaRDI portal
Publication:2019337
Recommendations
- Faster algorithms for computing power indices in weighted voting games
- Efficient Computation of Power Indices for Weighted Majority Games
- Computing power indices in weighted multiple majority games.
- Computation of several power indices by generating functions
- scientific article; zbMATH DE number 1766750
Cites work
- scientific article; zbMATH DE number 1766750 (Why is no real title available?)
- A new index of power for simple n-person games
- A three-dimensional voting system in Hong Kong
- An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
- Assessing success and decisiveness in voting situations
- Computing power indices in weighted multiple majority games.
- Efficient Computation of Power Indices for Weighted Majority Games
- Generating functions for computing power indices efficiently
- Graph-Based Algorithms for Boolean Function Manipulation
- Multilinear Extensions of Games
- On the Theory of Dynamic Programming
- On the characterization of weighted simple games
- On the existence of a minimum integer representation for weighted voting systems
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- The distribution of power in the European constitution
- Three-valued simple games
- Weighted multiple majority games with unions: generating functions and applications to the European Union
- Weighted voting, multicameral representation, and power
Cited in
(2)
This page was built for publication: Dynamic programming algorithms for computing power indices in weighted multi-tier games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019337)