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

DOI10.1007/s00182-006-0069-7zbMath1138.91006MaRDI 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 value; minimum cost spanning tree problem; equal contribution property; optimistic TU game; pessimistic TU game

Mathematics Subject Classification ID

91A12: Cooperative games

Related Items

Pure Bargaining Problems and the Shapley Rule, Allocation rules for games with optimistic aspirations, Linking the Kar and folk solutions through a problem separation property, A characterization of kruskal sharing rules for minimum cost spanning tree problems, The truncated core for games with upper bounds, Merge-proofness in minimum cost spanning tree problems, Minimum cost arborescences, A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations, A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems, Minimum cost spanning tree problems with groups, 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, Investigation on irreducible cost vectors in minimum cost arborescence problems, Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases, A generalization of obligation rules for minimum cost spanning tree problems, The folk solution and Boruvka's algorithm in minimum cost spanning tree problems, An axiomatic approach in minimum cost spanning tree problems with groups, A monotonic and merge-proof rule in minimum cost spanning tree situations, A new rule for source connection problems, COST SHARING IN NETWORKS: SOME OPEN QUESTIONS, CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS, Approximate stable solutions in infinite tree problems

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