Fair cost-sharing methods for the minimum spanning tree game

DOI10.1016/j.ipl.2006.05.007zbMath1185.91056OpenAlexW2093881601MaRDI QIDQ845820

Lélia Blin, Laurent Gourvès, Eric Angel, Evripidis Bampis

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.007

zbMATH Keywords

fairnessgraph algorithmscost sharingminimum cost spanning tree gamebird rule

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• A fair rule in minimum cost spanning tree problems
• Minimum cost spanning tree games
• Cost allocation for a spanning tree
• Two Algorithms for Generating Weighted Spanning Trees in Order
• On cost allocation for a spanning tree: A game theoretic approach
• Optimum branchings
• Fairness in routing and load balancing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fair cost-sharing methods for the minimum spanning tree game