scientific article; zbMATH DE number 1766750
From MaRDI portal
Publication:4538166
DOI10.1016/S0453-4514(00)88752-9zbMATH Open1028.91511OpenAlexW4256023581MaRDI QIDQ4538166FDOQ4538166
Publication date: 11 July 2002
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0453-4514(00)88752-9
Title of this publication is not available (Why is that?)
Recommendations
- Efficient Computation of Power Indices for Weighted Majority Games
- Faster algorithms for computing power indices in weighted voting games
- Computing power indices in weighted multiple majority games.
- NP-completeness for calculating power indices of weighted majority games
- Computing power indices for large voting games
Cited In (44)
- Algorithm for automatic computation of the power variations in share tradings
- Approximations to the Banzhaf Index of Voting Power
- Size of random Galois lattices and number of closed frequent itemsets
- On the computational complexity of weighted voting games
- Title not available (Why is that?)
- A stochastic approach to approximate values in cooperative games
- Voting power in the EU council of ministers and fair decision making in distributive politics
- A generating functions approach for computing the public good index efficiently
- Complexity of computing the Shapley value in partition function form games
- Computing power indices in weighted multiple majority games.
- Dynamic programming algorithms for computing power indices in weighted multi-tier games
- Composition independence in compound games: a characterization of the Banzhaf power index and the Banzhaf value
- Complexity results for calculating power indices of weighted majority games
- Correlation and inequality in weighted majority voting games
- The MaxIS-Shapley value in perfect graphs
- The Complexity of Power-Index Comparison
- Measuring power in coalitional games with friends, enemies and allies
- Confidence intervals for the Shapley-Shubik power index in Markovian games
- The complexity of power indexes with graph restricted coalitions
- Social disruption games in signed networks
- Modified indices of political power: a case study of a few parliaments
- Some open problems in simple games
- Cooperation through social influence
- Heuristic and exact solutions to the inverse power index problem for small voting bodies
- Dynamic programming for computing power indices for weighted voting games with precoalitions
- Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
- Manipulating the quota in weighted voting games
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
- Cooperative games with overlapping coalitions: charting the tractability frontier
- Power indices and the measurement of control in corporate structures
- Voting power in the European Union enlargement
- Fair cost allocations under conflicts - a game-theoretic point of view -
- NP-completeness for calculating power indices of weighted majority games
- Selfish bin covering
- Faster algorithms for computing power indices in weighted voting games
- Title not available (Why is that?)
- On the use of binary decision diagrams for solving problems on simple games
- Implicit power indices for measuring indirect control in corporate structures
- Efficient Computation of Power Indices for Weighted Majority Games
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- The exact lower bound for the Coleman index of the power of a collectivity for a special class of simple majority games
- Forms of representation for simple games: sizes, conversions and equivalences
- Monte Carlo methods for the Shapley-Shubik power index
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538166)
