Minimum cost arborescences

DOI10.1016/j.geb.2011.05.007zbMath1278.91090MaRDI QIDQ665084

Debasis Mishra, Bhaskar Dutta

Publication date: 5 March 2012

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

Full work available at URL: http://ageconsearch.umn.edu/record/271310

zbMATH Keywords

continuity; cost allocation; core stability; directed networks; cost monotonicity

Mathematics Subject Classification ID

91A12: Cooperative games

91A43: Games involving graphs

91A80: Applications of game theory

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Cost allocation in asymmetric trees, Strategic sharing of a costly network, Minimum incoming cost rules for arborescences, Investigation on irreducible cost vectors in minimum cost arborescence problems, Hyperadditive games and applications to networks or matching problems, One-way and two-way cost allocation in hub network problems, Routing-proofness in congestion-prone networks, Stability and fairness in the job scheduling problem, CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• On obligation rules for minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Minimum cost spanning tree games and population monotonic allocation schemes.
• The optimistic \(TU\) game in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• Cores of convex games
• Sharing the Cost of a Capacity Network
• Potential, Value, and Consistency
• On cost allocation for a spanning tree: A game theoretic approach
• Optimum branchings