The complexity of power indexes with graph restricted coalitions
From MaRDI portal
Publication:898757
DOI10.1016/J.MATHSOCSCI.2015.04.001zbMATH Open1331.91017OpenAlexW2004353559MaRDI QIDQ898757FDOQ898757
Authors: Stefano Benati, Romeo Rizzi, Craig A. Tovey 
Publication date: 18 December 2015
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2015.04.001
Recommendations
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43) Voting theory (91B12)
Cites Work
- Computing power indices in weighted multiple majority games.
- Computational Complexity
- The complexity of computing the permanent
- Linear time solvable optimization problems on graphs of bounded clique-width
- Easy problems for tree-decomposable graphs
- Graphs and Cooperation in Games
- The core of games on ordered structures and graphs
- Title not available (Why is that?)
- On the Position Value for Communication Situations
- Crossing Number is NP-Complete
- Values of Graph-Restricted Games
- The Banzhaf value and communication situations
- Approximating the Permanent
- Generating functions for computing the Myerson value
- Mathematics and Politics
- Complexity Results for Bandwidth Minimization
- On the Complexity of Cooperative Solution Concepts
- Generating functions for computing power indices efficiently
- PP is as Hard as the Polynomial-Time Hierarchy
- Polynomial calculation of the Shapley value based on sampling
- Voting power in the European Union enlargement
- Probabilistic spatial power indexes
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Computing power indices for large voting games
- On the computational complexity of weighted voting games
- NP-completeness for calculating power indices of weighted majority games
- Title not available (Why is that?)
- NP-completeness of some problems concerning voting games
- Faster algorithms for computing power indices in weighted voting games
- Efficient Computation of Power Indices for Weighted Majority Games
- Preferences, the agenda setter, and the distribution of power in the EU
- Easy weighted majority games
Cited In (8)
- Protectionism and blocking power indices
- Merging and splitting for power indices in weighted voting games and network flow games on hypergraphs
- The complexity of power-index comparison
- The Complexity of Power-Index Comparison
- Measuring power in coalitional games with friends, enemies and allies
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union
- Attachment centrality: measure for connectivity in networks
- Title not available (Why is that?)
This page was built for publication: The complexity of power indexes with graph restricted coalitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898757)
