Minimum cost spanning tree problems with groups

DOI10.1007/S00199-009-0444-2MaRDI QIDQ964464zbMATH OpenOpenAlexFDO

Authors G. Bergantiños, M. Gómez-Rúa

Publication date 15 April 2010

Published in Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00199-009-0444-2

zbMATH Keywords

coalitional valuecost allocationminimum cost spanning tree problems

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• An axiomatic approach in minimum cost spanning tree problems with groups
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• Minimum Diameter Spanning Trees and Related Problems
• Minimum cost spanning tree problems as value sharing problems
• A constrained minimum spanning tree problem
• Approximating minimum-cost graph problems with spanning tree edges
• On the simultaneous minimum spanning trees problem
• On the minimum diameter spanning tree problem
• Minimum spanning hypertrees
• The Minimum Spanning Tree Constraint

Cites work

• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A non-cooperative approach to the cost spanning tree problem.
• Additivity in minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Component efficient solutions in line-graph games with applications
• Cost monotonicity, consistency and minimum cost spanning tree games
• scientific article; zbMATH DE number 3614541 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Implementing cooperative solution concepts: a generalized bidding approach
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Noncooperative cost spanning tree games with budget restrictions
• On cost allocation for a spanning tree: A game theoretic approach
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• The P-value for cost sharing in minimum
• The irreducible Core of a minimum cost spanning tree game
• 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

(11)

• Cost-allocation problems for fuzzy agents in a fixed-tree network
• 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
• Minimum cost spanning tree problems as value sharing problems
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Cost allocation in asymmetric trees
• Fair waste pricing: an axiomatic analysis to the NIMBY problem
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• Cost allocation problems on highways with grouped users
• Characterization of monotonic rules in minimum cost spanning tree problems

This page was built for publication: Minimum cost spanning tree problems with groups

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