Sequential contributions rules for minimum cost spanning tree problems

DOI10.1016/j.mathsocsci.2012.02.001zbMath1248.91047OpenAlexW2043869311WikidataQ57832910 ScholiaQ57832910MaRDI QIDQ712474

Youngsub Chun, Joo Sung Lee

Publication date: 16 October 2012

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2012.02.001

zbMATH Keywords

minimum cost spanning tree problemssequential equal contributions rules

Mathematics Subject Classification ID

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

Related Items

Two new classes of methods to share the cost of cleaning up a polluted river ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ An axiomatic approach in minimum cost spanning tree problems with groups

Cites Work

• Unnamed Item
• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• Sharing a minimal cost spanning tree: beyond the folk solution
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• On the core and nucleolus of minimum cost spanning tree games
• A Simple Expression for the Shapley Value in a Special Case
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach