Axiomatization of the Shapley value on minimum cost spanning tree games

DOI10.1006/GAME.2001.0883MaRDI QIDQ700116zbMATH OpenOpenAlexFDO

Authors Anirban Kar

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

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Minimum cost spanning tree problems with indifferent agents
• The optimistic TU game in minimum cost spanning tree problems
• On cost allocation in communication networks
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution

Cites work

• scientific article; zbMATH DE number 956794 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A note on two problems in connexion with graphs
• A strategic model of social and economic networks
• Bird's tree allocations revisited
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• Cost allocation for a spanning tree
• Cost allocation for steiner trees
• Graphs and Cooperation in Games
• Minimum cost spanning tree games
• Monotonic games are spanning network games
• On cost allocation for a spanning tree: A game theoretic approach
• On the History of the Minimum Spanning Tree Problem
• On the core and nucleolus of minimum cost spanning tree games
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimum branchings
• Spanning network games.
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games

Cited in

(52)

• The Shapley value of phylogenetic trees
• Congestion network problems and related games
• The P-value for cost sharing in minimum
• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
• Linking the Kar and folk solutions through a problem separation property
• Merge-proofness in minimum cost spanning tree problems
• Sharing sequential values in a network
• A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
• Sharing a minimal cost spanning tree: beyond the folk solution
• An egalitarian solution to minimum cost spanning tree problems
• Cost sharing in networks: some open questions
• Sequential contributions rules for minimum cost spanning tree problems
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• Cost allocation in asymmetric trees
• Node-consistent Shapley value for games played over event trees with random terminal time
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Cost monotonicity, consistency and minimum cost spanning tree games
• Axiomatization of an allocation rule for ordered tree TU-games
• Minimum cost arborescences
• Minimum cost spanning tree problems with groups
• Maximizing the minimum voter satisfaction on spanning trees
• Characterizing rules in minimum cost spanning tree problems
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• Dynamic Cost-Sharing Game with Spanning Arborescence
• On obligation rules for minimum cost spanning tree problems
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
• Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
• Noncooperative cost spanning tree games with budget restrictions
• scientific article; zbMATH DE number 7274136 (Why is no real title available?)
• A monotonic and merge-proof rule in minimum cost spanning tree situations
• Cost additive rules in minimum cost spanning tree problems with multiple sources
• Characterization of monotonic rules in minimum cost spanning tree problems
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• An axiomatic approach in minimum cost spanning tree problems with groups
• A generalization of obligation rules for minimum cost spanning tree problems
• Sharing the cost of maximum quality optimal spanning trees
• Strategic sharing of a costly network
• The degree and cost adjusted folk solution for minimum cost spanning tree games
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A new rule for source connection problems
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Spanning-tree games
• Minimum cost spanning tree problems with indifferent agents
• The optimistic TU game in minimum cost spanning tree problems
• Cost-allocation problems for fuzzy agents in a fixed-tree network
• Minimum cost spanning tree problems as value sharing problems
• Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions

This page was built for publication: Axiomatization of the Shapley value on minimum cost spanning tree games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700116)