The optimistic \(TU\) game in minimum cost spanning tree problems

DOI10.1007/s00182-006-0069-7zbMath1138.91006OpenAlexW2008131782MaRDI QIDQ2458425

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 31 October 2007

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-006-0069-7

zbMATH Keywords

Shapley valueminimum cost spanning tree problemequal contribution propertyoptimistic TU gamepessimistic TU game

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (28)

A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ 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 ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Cooperative approach to a location problem with agglomeration economies ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Allocation rules for games with optimistic aspirations ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Minimum cost arborescences ⋮ Pure Bargaining Problems and the Shapley Rule ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ The truncated core for games with upper bounds ⋮ Minimum cost spanning tree problems with groups ⋮ Merge-proofness 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 ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ The folk solution and Boruvka's algorithm in minimum cost spanning tree problems ⋮ Approximate stable solutions in infinite tree problems ⋮ Additivity in minimum cost spanning tree problems ⋮ 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 ⋮ Cooperative and axiomatic approaches to the knapsack allocation problem ⋮ An axiomatic approach in minimum cost spanning tree problems with groups

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• A non-cooperative approach to the cost spanning tree problem.
• Cost monotonicity, consistency and minimum cost spanning tree games
• On weighted Shapley values
• Conference structures and fair allocation rules
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• A characterization of the Shapley value in queueing problems
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• A pessimistic approach to the queueing problem
• On the core and nucleolus of minimum cost spanning tree games
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: The optimistic \(TU\) game in minimum cost spanning tree problems