NP-completeness of some problems concerning voting games
International Journal of Game Theory
On the complexity of cooperative solution concepts
Mathematics of Operations Research
NP-completeness for calculating power indices of weighted majority games
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
A linear approximation method for the Shapley value
Artificial Intelligence
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
An anytime approximation method for the inverse Shapley value problem
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
Reasoning about coalitional games
Artificial Intelligence
Computing the nucleolus of weighted voting games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Boolean combinations of weighted voting games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The price of democracy in coalition formation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
False name manipulations in weighted voting games: splitting, merging and annexation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Coalition Structures in Weighted Voting Games
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On the dimensionality of voting games
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Solving coalitional resource games
Artificial Intelligence
Simple coalitional games with beliefs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local Search Algorithms for Core Checking in Hedonic Coalition Games
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
The Cost of Stability in Coalitional Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence
Monotone cooperative games and their threshold versions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proof systems and transformation games
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The good, the bad and the cautious: safety level cooperative games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
False-name manipulations in weighted voting games
Journal of Artificial Intelligence Research
Multi-agent coalition formation for distributed area coverage
CARE@AI'09/CARE@IAT'10 Proceedings of the CARE@AI 2009 and CARE@IAT 2010 international conference on Collaborative agents - research and development
Complexity of coalition structure generation
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The least-core of threshold network flow games
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Bribery in path-disruption games
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Graph-based coalitional games: an analysis via characteristics
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
The inverse shapley value problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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 | 0.00 |
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its weights exceeds a given threshold. Key questions in coalitional games include finding coalitions that are stable (in the sense that no member of the coalition has any rational incentive to leave it), and finding a division of payoffs to coalition members (an imputation) that is fair. We investigate the computational complexity of such questions for weighted threshold games. We study the core, the least core, and the nucleolus, distinguishing those problems that are polynomial-time computable from those that are NP-hard, and providing pseudopolynomial and approximation algorithms for the NP-hard problems.