Coalition structure generation over graphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Abstract: We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) o R over the subsets of nodes, the problem is to find a partition of N into connected subsets, that maximises the sum of the components values. This problem is generally NP-complete; in particular, it is hard for a defined class of valuation functions which are independent of disconnected members - that is, two nodes have no effect on each other's marginal contribution to their vertex separator. Nonetheless, for all such functions we provide bounds on the complexity of coalition structure generation over general and minor-free graphs. Our proof is constructive and yields algorithms for solving corresponding instances of the problem. Furthermore, we derive linear time bounds for graphs of bounded treewidth. However, as we show, the problem remains NP-complete for planar graphs, and hence, for any K_k minor free graphs where k geq 5. Moreover, a 3-SAT problem with m clauses can be represented by a coalition structure generation problem over a planar graph with O(m^2) nodes. Importantly, our hardness result holds for a particular subclass of valuation functions, termed edge sum, where the value of each subset of nodes is simply determined by the sum of given weights of the edges in the induced subgraph.
Recommendations
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- On the online coalition structure generation problem
- Coalitional games on sparse social networks
- scientific article; zbMATH DE number 5823886
- On the Complexity of Cooperative Solution Concepts
Cited in
(19)- Coalition structure generation with worst case guarantees
- Forming \(k\) coalitions and facilitating relationships in social networks
- Coalition structure generation for partition function games utilizing a concise graphical representation
- Sufficient and necessary conditions for solution finding in valuation-based systems
- A cooperative game-theoretic approach to the social ridesharing problem
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- A polyhedral study of lifted multicuts
- Pre-processing Techniques for Anytime Coalition Structure Generation Algorithms
- Randomized coalition structure generation
- A COP model for graph-constrained coalition formation
- On the online coalition structure generation problem
- A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets
- Coalition graphs
- An attention model for the formation of collectives in real-world domains
- On the complexity of core, kernel, and bargaining set
- Chorded cycle facets of the clique partitioning polytope
- A graph multi-separator problem for image segmentation
- Coalition structure generation: a survey
This page was built for publication: Coalition structure generation over graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143571)
