Characterizing rules in minimum cost spanning tree problems

DOI10.1016/J.ORL.2017.10.008zbMATH Open1409.91059OpenAlexW2766879053MaRDI QIDQ1728385

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

monotonicitycost sharingminimum cost spanning treerule

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Characterization of monotonic rules in minimum cost spanning tree problems
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• ``Optimistic weighted Shapley rules 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

Related Items (3)

A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ A fair 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)