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 core of network synthesis games
Mathematical Programming: Series A and B
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Coalitions among computationally bounded agents
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Coalition structure generation with worst case guarantees
Artificial Intelligence
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Fuzzy kernel-stable coalitions between rational agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Bayesian Reinforcement Learning for Coalition Formation under Uncertainty
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Agent-based virtual organisations for the Grid
Multiagent and Grid Systems - Smart Grid Technologies & Market Models
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
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
Overlapping Coalition Formation
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Coalition Structures in Weighted Voting Games
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Overlapping coalition formation for efficient data fusion in multi-sensor networks
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Enhancing cooperative search with concurrent interactions
Journal of Artificial Intelligence Research
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
Methods for task allocation via agent coalition formation
Artificial Intelligence
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence
Arbitrators in overlapping coalition formation games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Strategic Behavior in Interaction Selection and Contact Selection
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Using personality to create alliances in group recommender systems
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Overlapping coalition formation games: charting the tractability frontier
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Coalitional games via network flows
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On random quotas and proportional representation in weighted voting games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Arbitration and stability in cooperative games in overlapping coalitions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fostering Cooperation through Dynamic Coalition Formation and Partner Switching
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.00 |
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coalitions. However, in many domains where coalitions are associated with tasks, an agent may be involved in executing more than one task, and thus may distribute his resources among several coalitions. To tackle such scenarios, we introduce a model for cooperative games with overlapping coalitions-or overlapping coalition formation (OCF) games. We then explore the issue of stability in this setting. In particular, we introduce a notion of the core, which generalizes the corresponding notion in the traditional (non-overlapping) scenario. Then, under some quite general conditions, we characterize the elements of the core, and show that any element of the core maximizes the social welfare. We also introduce a concept of balancedness for overlapping coalitional games, and use it to characterize coalition structures that can be extended to elements of the core. Finally, we generalize the notion of convexity to our setting, and show that under some natural assumptions convex games have a non-empty core. Moreover, we introduce two alternative notions of stability in OCF that allow a wider range of deviations, and explore the relationships among the corresponding definitions of the core, as well as the classic (non-overlapping) core and the Aubin core. We illustrate the general properties of the three cores, and also study them from a computational perspective, thus obtaining additional insights into their fundamental structure.