A monotonic and merge-proof rule in minimum cost spanning tree situations

DOI10.1007/S00199-016-0996-XzbMath1404.91150OpenAlexW1621484165MaRDI QIDQ2358794

María Gómez-Rúa, Juan J. Vidal-Puga

Publication date: 16 June 2017

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/62923/1/MPRA_paper_62923.pdf

zbMATH Keywords

cost sharingweighted Shapley valueminimum cost spanning tree problemscost monotonicitymerge-proofnesscore selection

Mathematics Subject Classification ID

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

Related Items (3)

Sharing the cost of risky projects ⋮ Sharing cost of network among users with differentiated willingness to pay ⋮ Profit-sharing and efficient time allocation

Cites Work

• Implementing efficient graphs in connection networks
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Comparable characterizations of four solutions for permission tree games
• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• Merge-proofness in minimum cost spanning tree problems
• Decentralized pricing in minimum cost spanning trees
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• An allocation rule for dynamic random network formation processes
• Characterization of monotonic rules in 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
• Sharing a minimal cost spanning tree: beyond the folk solution
• Additivity in minimum cost spanning tree problems
• On weighted Shapley values
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Pricing traffic in a spanning network
• The average tree permission value for games with a permission tree
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• The optimistic \(TU\) game in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• The irreducible Core of a minimum cost spanning tree game
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: A monotonic and merge-proof rule in minimum cost spanning tree situations