Theory of linear and integer programming
Theory of linear and integer programming
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Cooperative Multiagent Systems: A Personal View of the State of the Art
IEEE Transactions on Knowledge and Data Engineering
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Overlapping coalition formation for efficient data fusion in multi-sensor networks
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Task allocation via coalition formation among autonomous agents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Contribution games in social networks
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Cooperative games with overlapping coalitions
Journal of Artificial Intelligence Research
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Arbitrators in overlapping coalition formation games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Inetlligence and Machine Learning)
Subsidies, stability, and restricted cooperation in coalitional games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Arbitration and stability in cooperative games in overlapping coalitions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Cooperative games with overlapping coalitions (OCF games) [3, 23] model scenarios where agents can distribute their resources among several tasks; each task generates a profit which may be freely divided among the agents participating in the task. The goal of this work is to initiate a systematic investigation of algorithmic aspects of OCF games. We propose a discretized model of over-lapping coalition formation, where each agent i ε N has a weight wi ε N and may allocate an integer amount of weight to any task. Within this framework, we focus on the computation of outcomes that are socially optimal and/or stable. We discover that the algorithmic complexity of the associated problems crucially depends on the amount of resources that each agent possesses, the maximum coalition size, and the pattern of interaction among the agents. We identify several constraints that lead to tractable subclasses of OCF games, and provide efficient algorithms for games that belong to these subclasses. We supplement our tractability results by hardness proofs, which clarify the role of our constraints.