The minimum cost spanning forest game
type: Item
instance of: scholarly article
title: The minimum cost spanning forest game
zbMATH Open document ID: 1328.91039
DOI: 10.1016/0165-1765(87)90144-3
author: Edward C. Rosenthal
published in: Economics Letters
publication date: 2016-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 6525217
MaRDI profile type: Publication
full work available at URL: 0165-1765(87)90144-3
OpenAlex ID: W2093156710
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Minimum cost spanning tree games
cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
cites work: Cores of convex games
Recommended article: The minimum cost shortest-path tree game
Recommended article: The Stackelberg minimum spanning tree game
Recommended article: The Stackelberg Minimum Spanning Tree Game
Recommended article: Minimum cost forest games
Recommended article: The irreducible Core of a minimum cost spanning tree game
Recommended article: Generalized minimum spanning tree games
Recommended article: Multi-criteria minimum cost spanning tree games
Recommended article: Minimum-cost spanning tree games: Bird rule revisited
Recommended article: Spanning-Tree Games.
Recommended article: SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES
description: scientific article; zbMATH DE number 6525217