The minimum cost spanning forest game

DOI10.1016/0165-1765(87)90144-3zbMath1328.91039OpenAlexW2093156710MaRDI QIDQ899945

Edward C. Rosenthal

Publication date: 1 January 2016

Published in: Economics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1765(87)90144-3

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (10)

Communication and its cost in graph-restricted games ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Minimum cost forest games ⋮ Proof of permutationally convexity of MCSF games ⋮ Cooperative games arising from network flow problems ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ On the core and nucleolus of directed acyclic graph games ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources ⋮ Three-person spanning tree games

Cites Work

• Cores of convex 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
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree

This page was built for publication: The minimum cost spanning forest game