Characterizing rules in minimum cost spanning tree problems

DOI10.1016/J.ORL.2017.10.008MaRDI QIDQ1728385zbMATH OpenOpenAlexFDO

Authors Boya Yu, Lingsheng Shi

Publication date 22 February 2019

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

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

zbMATH Keywords

cost sharingminimum cost spanning treemonotonicityrule

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Games involving graphs (91A43)

Recommendations

• Additivity in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• Characterization of monotonic rules in minimum cost spanning tree problems
• An axiomatic approach in minimum cost spanning tree problems with groups
• A characterization of the folk rule for multi-source minimal cost spanning tree problems

Cites work

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Characterization of monotonic rules in minimum cost spanning tree problems
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• On cost allocation for a spanning tree: A game theoretic approach
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The irreducible Core of a minimum cost spanning tree game

Cited in

(6)

• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
• An axiomatic approach in minimum cost spanning tree problems with groups
• A fair rule in minimum cost spanning tree problems
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• Additivity in minimum cost spanning tree problems

This page was built for publication: Characterizing rules in minimum cost spanning tree problems

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