Dominating set games

Authors:
Bas Van Velzen
Affiliations:
CentER and Department of Econometrics and Operations Research, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands
Venue:
Operations Research Letters
Year:
2004

Citing 3
Cited 3

Computational complexity of a cost allocation approach to a fixed cost spanning forest problem

Mathematics of Operations Research
Ideal 0,1 matrices

Journal of Combinatorial Theory Series B
Algorithmic Aspects of the Core of Combinatorial Optimization Games

Mathematics of Operations Research

Core stability of vertex cover games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Total dominating set games

WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the cores of games arising from integer edge covering functions of graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study cooperative cost games arising from domination problems on graphs. We introduce three games to model the cost allocation problem and we derive a necessary and sufficient condition for the balancedness of all three games.