The irreducible Core of a minimum cost spanning tree game

DOI10.1007/BF01414212zbMATH Open0806.90128OpenAlexW1969609083MaRDI QIDQ3142157FDOQ3142157

Authors: Harry Aarts, Theo S. H. Driessen 

Publication date: 8 December 1993

Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01414212

Recommendations

• On the core and nucleolus of minimum cost spanning tree games
• The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
• scientific article
• On the set of extreme core allocations for minimal cost spanning tree problems
• On the core of the minimum cost Steiner tree game in networks

zbMATH Keywords

core allocationminimum cost spanning tree

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Cites Work

• A problem of rights arbitration from the Talmud
• Cores of convex games
• Minimum cost spanning tree games
• On the core and nucleolus of minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Extensions of Mappings into n-Cubes
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games

Cited In (27)

• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• The minimum cost spanning forest game
• Note on the computational complexity of least core concepts for min-cost spanning tree games.
• Three-person spanning tree games
• The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
• Merge-proofness in minimum cost spanning tree problems
• Cost sharing in networks: some open questions
• The Stackelberg minimum spanning tree game
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• On the core of the minimum cost Steiner tree game in networks
• On approximately fair cost allocation in Euclidean TSP games
• On the core of cost-revenue games: minimum cost spanning tree games with revenues
• Characterizing rules in minimum cost spanning tree problems
• Minimum cost spanning tree problems with groups
• Decentralized pricing in minimum cost spanning trees
• On the complexity of testing membership in the core of min-cost spanning tree games
• A monotonic and merge-proof rule in minimum cost spanning tree situations
• Operations research games: A survey. (With comments and rejoinder)
• Characterization of monotonic rules in minimum cost spanning tree problems
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Truth-telling and Nash equilibria in minimum cost spanning tree models
• An axiomatic approach in minimum cost spanning tree problems with groups
• On the core and nucleolus of minimum cost spanning tree games
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• Title not available (Why is that?)
• Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof

This page was built for publication: The irreducible Core of a minimum cost spanning tree game

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