Additivity in minimum cost spanning tree problems

DOI10.1016/j.jmateco.2008.03.003zbMath1154.91357OpenAlexW2165336189MaRDI QIDQ999732

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 10 February 2009

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2008.03.003

zbMATH Keywords

additivityminimum cost spanning tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Games involving graphs (91A43)

Related Items (25)

A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ Algorithms for computing the folk rule in minimum cost spanning tree problems with groups ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ On obligation rules for minimum cost spanning tree problems ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ The folk solution and Boruvka's algorithm in minimum cost spanning tree problems ⋮ A new rule for source connection problems ⋮ Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ An axiomatic approach in minimum cost spanning tree problems with groups

Cites Work

• Unnamed Item
• A non-cooperative approach to the cost spanning tree problem.
• Cost monotonicity, consistency and minimum cost spanning tree games
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Spanning network games.
• 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
• Minimum cost spanning tree games
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree

This page was built for publication: Additivity in minimum cost spanning tree problems