The irreducible Core of a minimum cost spanning tree game

DOI10.1007/BF01414212zbMath0806.90128OpenAlexW1969609083MaRDI QIDQ3142157

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)

Related Items (18)

A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ A fair rule in minimum cost spanning tree problems ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems with groups ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Three-person spanning tree games ⋮ An axiomatic approach in minimum cost spanning tree problems with groups

Cites Work

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

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