Minimum cost spanning tree problems with indifferent agents

DOI10.1016/j.geb.2014.01.010zbMath1303.91036OpenAlexW2091236866MaRDI QIDQ2442831

Christian Trudeau

Publication date: 1 April 2014

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: http://web2.uwindsor.ca/economics/RePEc/wis/pdf/1306.pdf

zbMATH Keywords

cost sharingSteiner treeweighted Shapley valueminimum cost spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43)

Related Items

Sharing cost of network among users with differentiated willingness to pay

Cites Work

• A note on two problems in connexion with graphs
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Merge-proofness in minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost sharing with multiple technologies
• Network flow problems and permutationally concave games
• On weighted Shapley values
• Three methods to share joint costs or surplus
• Shortest path games
• A generalization of obligation rules for minimum cost spanning tree problems
• A discrete cost sharing model with technological cooperation
• A fair rule in minimum cost spanning tree problems
• Responsibility and cross-subsidization in cost sharing
• Serial Cost Sharing
• On cost allocation for a spanning tree: A game theoretic approach
• Steiner tree problems

This page was built for publication: Minimum cost spanning tree problems with indifferent agents