The complexity of power-index comparison
From MaRDI portal
Publication:1001906
DOI10.1016/J.TCS.2008.09.034zbMATH Open1155.91013OpenAlexW2041916646MaRDI QIDQ1001906FDOQ1001906
Authors: Piotr Faliszewski, Lane A. Hemaspaandra 
Publication date: 19 February 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.034
Recommendations
- The Complexity of Power-Index Comparison
- Comparing power indices
- Computing power indices: multilinear extensions and new characterizations
- scientific article; zbMATH DE number 4033074
- Power indices and easier hard problems
- Complexity results for calculating power indices of weighted majority games
- Power comparison for simple by characteristic polynomials
- A review of some recent results on power indices
- The complexity of comparing optimal solutions
- The complexity of power indexes with graph restricted coalitions
Cites Work
- The complexity of optimization problems
- Title not available (Why is that?)
- The complexity of computing the permanent
- Mathematical Properties of the Banzhaf Power Index
- Computational Complexity of Probabilistic Turing Machines
- On the Complexity of Cooperative Solution Concepts
- PP is as Hard as the Polynomial-Time Hierarchy
- NP-completeness for calculating power indices of weighted majority games
- The polynomial-time hierarchy and sparse oracles
- The Complexity of Planar Counting Problems
- NP-completeness of some problems concerning voting games
- #P-COMPLETENESS VIA MANY-ONE REDUCTIONS
- Title not available (Why is that?)
Cited In (18)
- Computing power indices: multilinear extensions and new characterizations
- Maximum box problem on stochastic points
- The complexity of the \(K\)th largest subset problem and related problems
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
- NP-completeness of some problems concerning voting games
- Power comparison for simple by characteristic polynomials
- The Complexity of Power-Index Comparison
- Structural control in weighted voting games
- Confidence intervals for the Shapley-Shubik power index in Markovian games
- Controlling weighted voting games by deleting or adding players with or without changing the quota
- The complexity of power indexes with graph restricted coalitions
- Manipulating the quota in weighted voting games
- Comparing Computational Power
- Power measures derived from the sequential query process
- NP-completeness for calculating power indices of weighted majority games
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Worst-case bounds on power vs. proportion in weighted voting games with an application to false-name manipulation
- Analyzing power in weighted voting games with super-increasing weights
This page was built for publication: The complexity of power-index comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001906)
