The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

DOI10.1016/J.MATHSOCSCI.2019.03.003zbMath1426.91142OpenAlexW2923272930WikidataQ128201038 ScholiaQ128201038MaRDI QIDQ2334863

Gustavo Bergantiños, Adriana Navarro-Ramos

Publication date: 8 November 2019

Published in: Mathematical Social Sciences (Search for Journal in Brave)

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

zbMATH Keywords

minimum cost spanning tree problemsfolk rulecost allocation rule

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (4)

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ A characterization of the folk rule for multi-source minimal cost spanning tree problems

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The minimum cost spanning forest game
• The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
• On obligation rules for minimum cost spanning tree problems
• Additivity in minimum cost spanning tree problems
• Minimum cost forest games
• Minimum cost spanning tree games and population monotonic allocation schemes.
• A generalization of obligation rules for minimum cost spanning tree problems
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• A new rule for source connection problems
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources