Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
From MaRDI portal
Publication:2409675
DOI10.1016/j.artint.2017.04.005zbMath1419.68188OpenAlexW2605871908MaRDI QIDQ2409675
Antonella Guzzo, Gianluigi Greco
Publication date: 13 October 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2017.04.005
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Agent technology and artificial intelligence (68T42)
Related Items
A coalition-structure's generation method for solving cooperative computing problems in edge computing environments, Coalition formation in social environments with logic-based agents1, Measuring power in coalitional games with friends, enemies and allies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of core, kernel, and bargaining set
- Correlation clustering
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- Graph minors. III. Planar tree-width
- Coalition structure generation: a survey
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs
- The strategy structure of some coalition formation games
- An algorithm for distributing coalitional value calculations among cooperating agents
- Strongly balanced cooperative games
- Methods for task allocation via agent coalition formation
- Intermediate preferences and stable coalition structures
- Coalition structure generation with worst case guarantees
- On the computational complexity of weighted voting games
- A logical approach to multicut problems
- Complexity of constructing solutions in the core based on synergies among coalitions
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- Shapley meets Shapley
- Coalition Structure Generation over Graphs
- Easy problems for tree-decomposable graphs
- Multiway cut and integer flow problems in trees
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Multicut Algorithms via Tree Decompositions
- Correlation clustering with a fixed number of clusters
- On the multiway cut polyhedron
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Graphs and Cooperation in Games
- On the Complexity of Cooperative Solution Concepts
- The Complexity of Multiterminal Cuts
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
