Total balancedness condition for Steiner tree games.
type: Item
instance of: scholarly article
title: Total balancedness condition for Steiner tree games.
zbMATH Open document ID: 1045.91004
DOI: 10.1016/S0166-218X(02)00388-8
author: Qizhi Fang
author: Xiaotie Deng
author: Mao-Cheng Cai
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
review text: The authors consider and study the Steiner tree game. It has been shown that it is NP-hard to determine whether a Steiner tree game is balanced. The NP-hardness result is also established for deciding whether the core is non-empty or whether an imputation is a member of the core.
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91A18
zbMATH DE Number: 1925258
zbMATH Keywords: cooperative games
zbMATH Keywords: Steiner tree
zbMATH Keywords: core
zbMATH Keywords: total balancedness
zbMATH Keywords: NP-hard
reviewed by: Qamrul Hasan Ansari
MaRDI profile type: Publication
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Q4708452
cites work: Q4247447
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: Totally balanced combinatorial optimization games
cites work: On the Complexity of Cooperative Solution Concepts
cites work: On the complexity of testing membership in the core of min-cost spanning tree games
cites work: Q4198056
cites work: Q4952603
cites work: Minimum cost spanning tree games
cites work: Spanning network games.
cites work: Totally Balanced Games and Games of Flow
cites work: Cost allocation for steiner trees
cites work: On the core of linear production games
full work available at URL: s0166-218x(02)00388-8
OpenAlex ID: W2011951540
description: scientific article; zbMATH DE number 1925258