Axiomatization of the Shapley value on minimum cost spanning tree games
From MaRDI portal
Publication:700116
DOI10.1006/game.2001.0883zbMath1035.91007OpenAlexW2034641173MaRDI QIDQ700116
Publication date: 30 September 2002
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/game.2001.0883
Related Items (47)
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Sharing sequential values in a network ⋮ Cost allocation in asymmetric trees ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ 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 ⋮ Characterizing the Shapley value in fixed-route traveling salesman problems with appointments ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Minimum cost spanning tree problems with indifferent agents ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Minimum cost arborescences ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ The Shapley value of phylogenetic trees ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Sharing the cost of maximum quality optimal spanning trees ⋮ Spanning-Tree Games. ⋮ Strategic sharing of a costly network ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ A fair rule in minimum cost spanning tree problems ⋮ Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ The \(P\)-value for cost sharing in minimum ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ Congestion network problems and related 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 ⋮ Sequential contributions rules for minimum cost spanning tree problems ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ Noncooperative cost spanning tree games with budget restrictions ⋮ Maximizing the minimum voter satisfaction on spanning trees ⋮ A new rule for source connection problems ⋮ Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ An axiomatic approach in minimum cost spanning tree problems with groups ⋮ Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Spanning network games.
- Monotonic games are spanning network games
- A strategic model of social and economic networks
- On the core and nucleolus of minimum cost spanning tree games
- Minimum cost spanning tree games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- Graphs and Cooperation in Games
- On the History of the Minimum Spanning Tree Problem
- Optimum branchings
This page was built for publication: Axiomatization of the Shapley value on minimum cost spanning tree games
