A new stable and more responsive cost sharing solution for minimum cost spanning tree problems

DOI10.1016/j.geb.2011.09.002zbMath1280.91099MaRDI QIDQ417711

Christian Trudeau

Publication date: 14 May 2012

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2011.09.002

zbMATH Keywords

core; common property; private property; folk solution; minimum cost spanning tree

Mathematics Subject Classification ID

91A12: Cooperative games

91A43: Games involving graphs

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

An efficient characterization of submodular spanning tree games, Cost allocation in asymmetric trees, Absence-proofness: group stability beyond the core, Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems, Linking the Kar and folk solutions through a problem separation property, Strategic sharing of a costly network, On the core and nucleolus of directed acyclic graph games, Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions, Characterization of monotonic rules in minimum cost spanning tree problems, Minimum incoming cost rules for arborescences, The degree and cost adjusted folk solution for minimum cost spanning tree games, Clique games: a family of games with coincidence between the nucleolus and the Shapley value, One-way and two-way cost allocation in hub network problems, Allocating extra revenues from broadcasting sports leagues, Stable cost sharing in production allocation games, A monotonic and merge-proof rule in minimum cost spanning tree situations, On the set of extreme core allocations for minimal cost spanning tree problems, Minimum cost spanning tree problems with indifferent agents, CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS

Cites Work

• Linking the Kar and folk solutions through a problem separation property
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• On the convexity of communication games
• Sharing a minimal cost spanning tree: beyond the folk solution
• Additivity in minimum cost spanning tree problems
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• Cores of convex games
• On cost allocation for a spanning tree: A game theoretic approach