Sharing a minimal cost spanning tree: beyond the folk solution
From MaRDI portal
Publication:980947
DOI10.1016/j.geb.2009.11.001zbMath1230.91019OpenAlexW2058237281MaRDI QIDQ980947
Anna Bogomolnaia, Hervé Moulin
Publication date: 8 July 2010
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2009.11.001
Related Items (45)
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Generalized minimum spanning tree games ⋮ Cost allocation in asymmetric trees ⋮ Sharing the cost of risky projects ⋮ Absence-proofness: group stability beyond the core ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ One-way and two-way cost allocation in hub network problems ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Finding socially best spanning treesî ⋮ The price of imperfect competition for a spanning network ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Minimum cost arborescences ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Sharing the cost of maximum quality optimal spanning trees ⋮ Strategic sharing of a costly network ⋮ POPULAR SPANNING TREES ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ \textit{Folk} solution for simple minimum cost spanning tree problems ⋮ On the core and nucleolus of directed acyclic graph games ⋮ Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions ⋮ Knapsack cost sharing ⋮ Pricing traffic in a spanning network ⋮ On obligation rules for minimum cost spanning tree problems ⋮ Sequential contributions rules for minimum cost spanning tree problems ⋮ A note on maximizing the minimum voter satisfaction on spanning trees ⋮ Maximizing the minimum voter satisfaction on spanning trees ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ An axiomatic approach in minimum cost spanning tree problems with groups ⋮ On games arising from multi-depot Chinese postman 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
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- 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
- Sharing the Cost of a Capacity Network
- On the core and nucleolus of minimum cost spanning tree games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
This page was built for publication: Sharing a minimal cost spanning tree: beyond the folk solution
