The irreducible Core of a minimum cost spanning tree game

DOI10.1007/BF01414212MaRDI QIDQ3142157zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

core allocationminimum cost spanning tree

Mathematics Subject Classification ID

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

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; zbMATH DE number 5666824
• 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

Cites work

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

Cited in

(28)

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

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)