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.