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

DOI10.1007/S00199-007-0248-1MaRDI QIDQ926221zbMATH OpenOpenAlexFDO

Authors G. Bergantiños, S. 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)

Recommendations

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• The optimistic TU game in minimum cost spanning tree problems
• Additivity in minimum cost spanning tree problems
• Minimum cost spanning tree problems with indifferent agents
• A fair rule in minimum cost spanning tree problems

Cites work

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A new solution to the problem of adjudicating conflicting claims
• A non-cooperative approach to the cost spanning tree problem.
• Additive rules in discrete allocation problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Minimum cost spanning tree games
• No-envy in queueing problems
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On weighted Shapley values
• The optimistic TU game in minimum cost spanning tree problems
• The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results

Cited in

(18)

• Characterizing rules in minimum cost spanning tree problems
• Investigation on irreducible cost vectors in minimum cost arborescence problems
• Values for Markovian coalition processes
• Cooperative and axiomatic approaches to the knapsack allocation problem
• The average tree permission value for games with a permission tree
• A generalization of obligation rules for minimum cost spanning tree problems
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• The optimistic TU game in minimum cost spanning tree problems
• Minimum cost spanning tree problems as value sharing problems
• Absence-proofness: group stability beyond the core
• Comparable characterizations of four solutions for permission tree games
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares
• Axiomatizations of two types of Shapley values for games on union closed systems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Characterization of monotonic rules in 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
• On obligation rules for minimum cost spanning tree problems

This page was built for publication: A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems

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