Minimum cost forest games

DOI10.1007/BF01263278MaRDI QIDQ1365003zbMATH OpenOpenAlexFDO

Authors J. 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)

Recommendations

• The minimum cost spanning forest game
• Minimum cost arborescences
• A simple family of solutions for forest games
• The minimum cost shortest-path tree game
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES
• On the maximum income spanning forest games
• Domination game on forests
• The game of arboricity
• The game of arboricity
• scientific article; zbMATH DE number 949664

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A generalized linear production model: A unifying model
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• Cores of convex games
• Cost allocation for steiner trees
• Minimum cost spanning tree games
• Monotonic games are spanning network games
• On a cost allocation problem arising from a capacitated concentrator covering problem
• On cost allocation for a spanning tree: A game theoretic approach
• On the core of linear production games
• On the core of network synthesis games
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• The minimum cost spanning forest game

Cited in

(11)

• Proof of permutationally convexity of MCSF games
• Generalized minimum spanning tree games
• The minimum cost spanning forest game
• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
• Highway games on weakly cyclic graphs
• The folk rule for minimum cost spanning tree problems with multiple sources
• Trouble comes in threes: core stability in minimum cost connection networks
• 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
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES

This page was built for publication: Minimum cost forest games

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