Cost monotonicity, consistency and minimum cost spanning tree games

DOI10.1016/j.geb.2003.09.008zbMath1117.91308OpenAlexW2103267790MaRDI QIDQ705853

Anirban Kar, Bhaskar Dutta

Publication date: 16 February 2005

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

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

zbMATH Keywords

ConsistencyCost allocationSpanning treeCore selectionCost monotonicity

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (54)

A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Social enterprise tree network games ⋮ Sharing sequential values in a network ⋮ Generalized minimum spanning tree games ⋮ Cost allocation in asymmetric trees ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ 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 ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Finding socially best spanning treesî ⋮ Obligation rules for minimum cost spanning tree situations and their monotonicity properties ⋮ A cost allocation rule for \(k\)-hop minimum cost spanning tree problems ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Minimum cost arborescences ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Spanning-Tree Games. ⋮ Strategic sharing of a costly network ⋮ POPULAR SPANNING TREES ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ A fair rule in minimum cost spanning tree problems ⋮ Knapsack cost sharing ⋮ 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 ⋮ Pricing traffic in a spanning network ⋮ 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 ⋮ The folk solution and Boruvka's algorithm in minimum cost spanning tree problems ⋮ A note on maximizing the minimum voter satisfaction on spanning trees ⋮ Additivity in minimum cost spanning tree problems ⋮ Maximizing the minimum voter satisfaction on spanning trees ⋮ A new rule for source connection problems ⋮ A characterization of the folk rule for multi-source minimal cost spanning tree problems ⋮ Cost allocation protocols for supply contract design in network situations ⋮ Consistency and its converse: an introduction ⋮ Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms ⋮ Network flow problems and permutationally concave games ⋮ 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

Cites Work

• Unnamed Item
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Consistency and its converse: an introduction
• On the reduced game property and its converse
• Supportability of network cost functions
• Spanning network games.
• The Conditional Auction Mechanism for Sharing a Surplus
• On the core and nucleolus of minimum cost spanning tree games
• Potential, Value, and Consistency
• Minimum cost spanning tree games
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• On cost allocation for a spanning tree: A game theoretic approach
• On the History of the Minimum Spanning Tree Problem
• The kernel of a cooperative game

This page was built for publication: Cost monotonicity, consistency and minimum cost spanning tree games