The following pages link to (Q4538166):
Displayed 30 items.
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Voting power in the EU council of ministers and fair decision making in distributive politics (Q423076) (← links)
- A generating functions approach for computing the public good index efficiently (Q456940) (← links)
- 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)
- Selfish bin covering (Q650947) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Size of random Galois lattices and number of closed frequent itemsets (Q967342) (← links)
- Modified indices of political power: a case study of a few parliaments (Q1787929) (← links)
- Voting power in the European Union enlargement (Q1848640) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- A stochastic approach to approximate values in cooperative games (Q2001459) (← 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)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Measuring power in coalitional games with friends, enemies and allies (Q2093400) (← links)
- Implicit power indices for measuring indirect control in corporate structures (Q2151324) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- Composition independence in compound games: a characterization of the Banzhaf power index and the Banzhaf value (Q2329411) (← links)
- Cooperation through social influence (Q2630248) (← links)
- Dynamic programming for computing power indices for weighted voting games with precoalitions (Q2669159) (← links)
- POWER INDICES AND THE MEASUREMENT OF CONTROL IN CORPORATE STRUCTURES (Q2852567) (← links)
- SOME OPEN PROBLEMS IN SIMPLE GAMES (Q2854004) (← links)
- (Q5075402) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- Social disruption games in signed networks (Q6199710) (← links)