On the complexity of cooperative solution concepts
Mathematics of Operations Research
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
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Coalitional games in open anonymous environments
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Task allocation via coalition formation among autonomous agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Complexity of determining nonemptiness of the core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A kernel-oriented model for coalition-formation in general environments: implementation and results
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A randomized method for the shapley value for the voting game
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A linear approximation method for the Shapley value
Artificial Intelligence
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
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Non-transferable utility coalitional games via mixed-integer linear constraints
Journal of Artificial Intelligence Research
On the complexity of core, kernel, and bargaining set
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 |
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attributes jointly determine this value. This framework allows us to model diverse economic interactions by picking the right attributes. We study the computational complexity of two coalitional solution concepts for these games -- the Shapley value and the core. We show how the positive results obtained in this paper imply comparable results for other games studied in the literature.