An axiomatic approach in minimum cost spanning tree problems with groups

DOI10.1007/S10479-012-1251-XMaRDI QIDQ2348765zbMATH OpenOpenAlexFDO

Authors G. Bergantiños, M. Gómez-Rúa

Publication date 15 June 2015

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-012-1251-x

zbMATH Keywords

axiomatizationcost sharingfolk ruleminimum cost spanning tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Minimum cost spanning tree problems with groups
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• An algebraic framework for minimum spanning tree problems
• A generalization of the minimum branch vertices spanning tree problem
• The constrained minimum spanning tree problem
• Approximating minimum-cost graph problems with spanning tree edges
• On the generalized minimum spanning tree problem
• A fair rule in minimum cost spanning tree problems
• A generalization of obligation rules for minimum cost spanning tree problems
• Characterizing rules in minimum cost spanning tree problems

Cites work

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A generalization of obligation rules for minimum cost spanning tree problems
• A non-cooperative approach to the cost spanning tree problem.
• Additivity in 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
• Endogenous Formation of Coalitions
• Generalized coalitional semivalues
• scientific article; zbMATH DE number 3614541 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Minimum cost spanning tree problems with groups
• Noncooperative cost spanning tree games with budget restrictions
• On cost allocation for a spanning tree: A game theoretic approach
• On the core, the Weber set and convexity in games with a priori unions
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Sequential contributions rules for minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• The P-value for cost sharing in minimum
• The axiomatic approach to three values in games with coalition structure
• The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
• The irreducible Core of a minimum cost spanning tree game
• The optimistic TU game in minimum cost spanning tree problems

Cited in

(9)

• Characterizing rules in minimum cost spanning tree problems
• Investigation on irreducible cost vectors in minimum cost arborescence problems
• Cost additive rules in minimum cost spanning tree problems with multiple sources
• A characterization of the folk rule for multi-source minimal cost spanning tree problems
• Generalized minimum spanning tree games
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• Sequential contributions rules for minimum cost spanning tree problems
• Characterization of monotonic rules in minimum cost spanning tree problems
• Minimum cost spanning tree problems with groups

This page was built for publication: An axiomatic approach in minimum cost spanning tree problems with groups

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