CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
From MaRDI portal
Publication:2854002
DOI10.1142/S0219198913400033zbMath1274.91103OpenAlexW2052867428MaRDI QIDQ2854002
Publication date: 17 October 2013
Published in: International Game Theory Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219198913400033
Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (8)
On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Sharing the cost of maximum quality optimal spanning trees ⋮ Strategic sharing of a costly network ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- Merge-proofness in minimum cost spanning tree problems
- Decentralized pricing in minimum cost spanning trees
- Minimum cost arborescences
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Connection situations under uncertainty and cost monotonic solutions
- Minimum cost spanning tree problems with groups
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- On obligation rules for minimum cost spanning tree problems
- Sharing a minimal cost spanning tree: beyond the folk solution
- Additivity in minimum cost spanning tree problems
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Network flow problems and permutationally concave games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- A generalization of obligation rules for minimum cost spanning tree problems
- 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
- Congestion network problems and related games
- The irreducible Core of a minimum cost spanning tree game
- Sharing the Cost of a Capacity Network
- On the core and nucleolus of minimum cost spanning tree games
- A VALUE FOR PERT PROBLEMS
- Minimum cost spanning tree games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
This page was built for publication: CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
