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

DOI10.1016/J.ORL.2011.11.003zbMath1242.90273OpenAlexW2055690105MaRDI QIDQ433843

Gustavo Bergantiños, Joaquín Sánchez-Soriano, María Gómez-Rúa, Manuel A. Pulido, Natividad Llorca

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

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)

Related Items (7)

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

Cites Work

• Cost monotonicity, consistency and minimum cost spanning tree games
• Operations research games: A survey. (With comments and rejoinder)
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• 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
• Approximating \(k\)-hop minimum-spanning trees
• On the core and nucleolus of minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach

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