On the complexity of testing membership in the core of min-cost spanning tree games
From MaRDI portal
(Redirected from Publication:1365002)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cores of convex games
- Cost allocation for a spanning tree
- Geometric algorithms and combinatorial optimization
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On the Complexity of Cooperative Solution Concepts
- On the core of network synthesis games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- The irreducible Core of a minimum cost spanning tree game
Cited in
(32)- A system-theoretic model for cooperation, interaction and allocation
- Network strength games: the core and the nucleolus
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Pareto optimality in the kidney exchange Problem
- Computing Shapley values in the plane
- Social enterprise tree network games
- Generalized minimum spanning tree games
- On approximately fair cost allocation in Euclidean TSP games
- Path cooperative games
- Traveling salesman games with the Monge property
- Computing the least-core and nucleolus for threshold cardinality matching games
- Computing an element in the lexicographic kernel of a game
- On computational complexity of membership test in flow games and linear production games
- Enforcing fair cooperation in production-inventory settings with heterogeneous agents
- Social exchange networks with distant bargaining
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Complexity of constructing solutions in the core based on synergies among coalitions
- A note on Steiner tree games
- Computational complexity in additive hedonic games
- An efficient characterization of submodular spanning tree games
- A cooperative location game based on the 1-center location problem
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Total balancedness condition for Steiner tree games.
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- A generalization of obligation rules for minimum cost spanning tree problems
- Algorithmic solutions for maximizing shareable costs
- NP-completeness in hedonic games
- On the complexity of core, kernel, and bargaining set
- COALITION FORMATION GAMES: A SURVEY
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- The Least-Core and Nucleolus of Path Cooperative Games
- On the core and nucleolus of directed acyclic graph games
This page was built for publication: On the complexity of testing membership in the core of min-cost spanning tree games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365002)
