Total balancedness condition for Steiner tree games

Authors:
Qizhi Fang;Maocheng Cai;Xiaotie Deng
Affiliations:
Department of Mathematics, Ocean University of Qingdao, Qingdao 266003, People's Republic of China;Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, People's Republic of China;Department of Computer Science, City University of Hong Kong, Hong Kong, People's Republic of China
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 6
Cited 1

On the complexity of cooperative solution concepts

Mathematics of Operations Research
On the complexity of testing membership in the core of min-cost spanning tree games

International Journal of Game Theory
Spanning network games

International Journal of Game Theory
Cooperative facility location games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Aspects of the Core of Combinatorial Optimization Games

Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Traveling salesman games with the Monge property

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

In Steiner tree game associated with a graph G = (V,E), players consist of a subset N ⊆ V of nodes. The characteristic function value of a subset S ⊆ N of the players is the minimum weight of a Steiner tree that spans S. We show that it is NP-hard to determine whether a Steiner tree game is totally balanced, i.e., cores for all its subgames are non-empty. In addition, the NP-hardness result is also proven for deciding whether the core is non-empty, or whether an imputation is a member of the core.