On variations of the subset sum problem
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing the Banzhaf power index in network flow games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Power and stability in connectivity games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
The Complexity of Power-Index Comparison
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Note: The complexity of power-index comparison
Theoretical Computer Science
Power in threshold network flow games
Autonomous Agents and Multi-Agent Systems
The price of democracy in coalition formation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Computational complexity of weighted threshold games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Approximating power indices: theoretical and empirical analysis
Autonomous Agents and Multi-Agent Systems
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence
Honor among thieves: collusion in multi-unit auctions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
False-name manipulations in weighted voting games
Journal of Artificial Intelligence Research
Theoretical Computer Science
Manipulating the quota in weighted voting games
Artificial Intelligence
Graph-based coalitional games: an analysis via characteristics
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Ranking of decision rules with random power distribution
Mathematical and Computer Modelling: An International Journal
The Shapley value as a function of the quota in weighted voting games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: The consequences of eliminating NP solutions
Computer Science Review
Complementary cooperation, minimal winning coalitions, and power indices
Theoretical Computer Science
Proof systems and transformation games
Annals of Mathematics and Artificial Intelligence
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
Sharing rewards in cooperative connectivity games
Journal of Artificial Intelligence Research
| Hi-index | 5.23 |
In this paper, we prove that both problems for calculating the Banzhaf power index and the Shapley-Shubik power index for weighted majority games are NP-complete.