A cost allocation rule for k-hop minimum cost spanning tree problems

DOI10.1016/J.ORL.2011.11.003zbMATH Open1242.90273OpenAlexW2055690105MaRDI QIDQ433843FDOQ433843

Authors: G. Bergantiños, M. Gómez-Rúa, N. Llorca, M. Pulido, J. Sánchez-Soriano 

Publication date: 6 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.11.003

Recommendations

• A fair rule in minimum cost spanning tree problems
• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• Cost monotonicity, consistency and minimum cost spanning tree games
• Moving average rule for minimum cost spanning tree games
• Cost additive rules in minimum cost spanning tree problems with multiple sources

zbMATH Keywords

bankruptcy problems\(k\)-hop minimum cost spanning tree problemsconstrained equal awards rule

Mathematics Subject Classification ID

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

Cites Work

• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• On the core and nucleolus of minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Cost monotonicity, consistency and minimum cost spanning tree games
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• A fair rule in minimum cost spanning tree problems
• Operations research games: A survey. (With comments and rejoinder)
• Approximating \(k\)-hop minimum-spanning trees

Cited In (8)

• Sustainable allocation of greenhouse gas emission permits for firms with Leontief technologies
• Cost allocation in asymmetric trees
• Equilibria in a competitive model arising from linear production situations with a common-pool resource
• A fair rule in minimum cost spanning tree problems
• A new rule for source connection problems
• On the set of extreme core allocations for minimal cost spanning tree problems
• Families of sequential priority rules and random arrival rules with withdrawal limits
• Multi-issue bankruptcy problems with crossed claims

This page was built for publication: A cost allocation rule for \(k\)-hop minimum cost spanning tree problems

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