A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems

DOI10.1007/s00199-007-0248-1zbMath1148.91004OpenAlexW2057313782MaRDI QIDQ926221

Gustavo Bergantiños, Silvia Lorenzo-Freire

Publication date: 26 May 2008

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00199-007-0248-1

zbMATH Keywords

Minimum cost spanning tree problemsWeighted Shapley values

Mathematics Subject Classification ID

Cooperative games (91A12) Utility theory for games (91A30)

Related Items (14)

Absence-proofness: group stability beyond the core ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ Comparable characterizations of four solutions for permission tree games ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ Axiomatizations of two types of Shapley values for games on union closed systems ⋮ The average tree permission value for games with a permission tree ⋮ Values for Markovian coalition processes ⋮ On obligation rules for minimum cost spanning tree problems ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ Cooperative and axiomatic approaches to the knapsack allocation problem

Cites Work

• Unnamed Item
• 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
• The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results
• On weighted Shapley values
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• The optimistic \(TU\) game in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• Additive rules in discrete allocation problems
• A new solution to the problem of adjudicating conflicting claims
• No-envy in queueing problems
• 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: A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems