A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations

DOI10.1007/s11750-009-0113-4zbMath1179.90058OpenAlexW2042179557MaRDI QIDQ845585

S. H. Tijs, Barış Çiftçi

Publication date: 29 January 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-009-0113-4

zbMATH Keywords

cost allocationminimum cost spanning tree situations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (3)

Avoiding unfairness of \textit{Owen} allocations in linear production processes ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• Additivity in minimum cost spanning tree problems
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• The optimistic \(TU\) game in minimum cost spanning tree problems
• 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
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• The Consistent Coalitional Value

This page was built for publication: A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations