Minimum cost arborescences
From MaRDI portal
Publication:665084
DOI10.1016/J.GEB.2011.05.007zbMath1278.91090OpenAlexW2043477913MaRDI QIDQ665084
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
Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (11)
Cost allocation in asymmetric trees ⋮ One-way and two-way cost allocation in hub network problems ⋮ Routing-proofness in congestion-prone networks ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Strategic sharing of a costly network ⋮ Hyperadditive games and applications to networks or matching problems ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ 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
This page was built for publication: Minimum cost arborescences
