Fair cost-sharing methods for the minimum spanning tree game

DOI10.1016/J.IPL.2006.05.007zbMATH Open1185.91056OpenAlexW2093881601MaRDI QIDQ845820FDOQ845820

Authors: Eric Angel, Lélia Blin, Laurent Gourvès, 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

Recommendations

• A fair rule in minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Generalized minimum spanning tree games
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Strategic sharing of a costly network

zbMATH Keywords

fairnessgraph algorithmscost sharingminimum cost spanning tree gamebird rule

Mathematics Subject Classification ID

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

Cites Work

• Minimum cost spanning tree games
• A course in game theory.
• Optimum branchings
• On cost allocation for a spanning tree: A game theoretic approach
• Fairness in routing and load balancing
• Cost allocation for a spanning tree
• A fair rule in minimum cost spanning tree problems
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Cooperative game theory and applications. Cooperative games arising from combinatorial optimization problems
• Bird's tree allocations revisited

Cited In (6)

• A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
• On approximately fair cost allocation in Euclidean TSP games
• Title not available (Why is that?)
• Minimum cost spanning tree games and spillover stability
• A fair rule in minimum cost spanning tree problems
• Title not available (Why is that?)

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

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