Sequential contributions rules for minimum cost spanning tree problems

DOI10.1016/J.MATHSOCSCI.2012.02.001zbMATH Open1248.91047OpenAlexW2043869311WikidataQ57832910 ScholiaQ57832910MaRDI QIDQ712474FDOQ712474

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)

Cites Work

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

Cited In (5)

• Additivity in minimum cost spanning tree problems
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• An axiomatic approach in minimum cost spanning tree problems with groups
• 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

This page was built for publication: Sequential contributions rules for minimum cost spanning tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712474)