Minimum cost forest games

DOI10.1007/BF01263278zbMath0880.90157OpenAlexW4252139632MaRDI QIDQ1365003

Jeroen Kuipers

Publication date: 28 August 1997

Published in: International Journal of Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

corecable-networkforest gamesminimum cost spanning tree game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (6)

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Highway games on weakly cyclic graphs ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ On the core and nucleolus of directed acyclic graph games ⋮ Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

Cites Work

• On the core of network synthesis games
• The minimum cost spanning forest game
• On a cost allocation problem arising from a capacitated concentrator covering problem
• Monotonic games are spanning network games
• Cores of convex games
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• On the core of linear production games
• On cost allocation for a spanning tree: A game theoretic approach
• Cost allocation for steiner trees
• Unnamed Item

This page was built for publication: Minimum cost forest games