Total dominating set games

Authors:
Qizhi Fang;Hye Kyung Kim;Dae Sik Lee
Affiliations:
Department of Mathematics, Ocean University of China, Qingdao, China;Department of Mathematics, Catholic University of Daegu, Kyungsan, Korea;College of Information & Computer Engineering, Daegu University, Kyungsan, Korea
Venue:
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Year:
2005

Citing 7
Cited 0

Total domination in interval graphs

Information Processing Letters
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
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
Dominating set games

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider cooperative games arising from total domination problem on graphs. We introduce two games, rigid total dominating set game and relaxed total dominating set game, and focus on their cores. First, a common necessary and sufficient condition for the balancedness of the two total dominating set games is obtained. Next, the computational issues on cores are discussed. We prove that in general the problems of testing the balancedness and testing the membership of the core are all $\cal {NP}$-hard for both total dominating set games.