Pages that link to "Item:Q4909584"
From MaRDI portal
The following pages link to Efficient Computation of Power Indices for Weighted Majority Games (Q4909584):
Displaying 15 items.
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- A fuzzy opportunity and threat aggregation approach in multicriteria decision analysis (Q604923) (← links)
- Heuristic and exact solutions to the inverse power index problem for small voting bodies (Q744673) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- The exact lower bound for the Coleman index of the power of a collectivity for a special class of simple majority games (Q943593) (← links)
- Computing power indices in weighted multiple majority games. (Q1402487) (← links)
- Dynamic programming algorithms for computing power indices in weighted multi-tier games (Q2019337) (← links)
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union (Q2068879) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Implicit power indices for measuring indirect control in corporate structures (Q2151324) (← links)
- Dynamic programming for computing power indices for weighted voting games with precoalitions (Q2669159) (← links)
- Complexity results for calculating power indices of weighted majority games (Q2753324) (← links)
- Game Theoretical Approach for Reliable Enhanced Indexation (Q4691960) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- (Q5075402) (← links)
