Pages that link to "Item:Q1779724"
From MaRDI portal
The following pages link to Faster algorithms for computing power indices in weighted voting games (Q1779724):
Displaying 18 items.
- Confidence intervals for the Shapley-Shubik power index in Markovian games (Q471433) (← links)
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446) (← links)
- A relation-algebraic approach to simple games (Q631101) (← 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)
- On calculation of the power indices with allowance for the agent preferences (Q1027721) (← links)
- A new algorithm to find the smallest committee containing a given set of players (Q1102212) (← links)
- Power indices of players in systems with weighted voting (Q1348542) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Dynamic programming algorithms for computing power indices in weighted multi-tier games (Q2019337) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Complexity results for calculating power indices of weighted majority games (Q2753324) (← links)
- Power indices and the measurement of control in corporate structures (Q2852567) (← links)
- (Q3585501) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- Efficient Computation of Power Indices for Weighted Majority Games (Q4909584) (← links)
