Pages that link to "Item:Q531446"
From MaRDI portal
The following pages link to Power indices of simple games and vector-weighted majority games by means of binary decision diagrams (Q531446):
Displaying 15 items.
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView (Q383785) (← links)
- A relation-algebraic approach to simple games (Q631101) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation (Q1652281) (← 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)
- On the enumeration of bipartite simple games (Q2022519) (← links)
- Set-weighted games and their application to the cover problem (Q2083971) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Implicit power indices for measuring indirect control in corporate structures (Q2151324) (← links)
- Computation of several power indices by generating functions (Q2344626) (← links)
- Cooperation through social influence (Q2630248) (← links)
- Dynamic programming for computing power indices for weighted voting games with precoalitions (Q2669159) (← links)
- (Q5075402) (← links)
