The complexity of power indexes with graph restricted coalitions
From MaRDI portal
Publication:898757
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1766750 (Why is no real title available?)
- Approximating the Permanent
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Complexity Results for Bandwidth Minimization
- Computational Complexity
- Computing power indices for large voting games
- Computing power indices in weighted multiple majority games.
- Crossing Number is NP-Complete
- Easy problems for tree-decomposable graphs
- Easy weighted majority games
- Efficient Computation of Power Indices for Weighted Majority Games
- Faster algorithms for computing power indices in weighted voting games
- Generating functions for computing power indices efficiently
- Generating functions for computing the Myerson value
- Graphs and Cooperation in Games
- Linear time solvable optimization problems on graphs of bounded clique-width
- Mathematics and Politics
- NP-completeness for calculating power indices of weighted majority games
- NP-completeness of some problems concerning voting games
- On the Complexity of Cooperative Solution Concepts
- On the Position Value for Communication Situations
- On the computational complexity of weighted voting games
- PP is as Hard as the Polynomial-Time Hierarchy
- Polynomial calculation of the Shapley value based on sampling
- Preferences, the agenda setter, and the distribution of power in the EU
- Probabilistic spatial power indexes
- The Banzhaf value and communication situations
- The complexity of computing the permanent
- Values of Graph-Restricted Games
- Voting power in the European Union enlargement
Cited in
(10)- Merging and splitting for power indices in weighted voting games and network flow games on hypergraphs
- The complexity of power-index comparison
- Attachment centrality: measure for connectivity in networks
- scientific article; zbMATH DE number 1843547 (Why is no real title available?)
- Measuring power in coalitional games with friends, enemies and allies
- The Complexity of Power-Index Comparison
- Monotonicity of power in weighted voting games with restricted communication
- Political power on a line graph
- Voting power on a graph connected political space with an application to decision-making in the council of the European Union
- Protectionism and blocking power indices
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)