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. Furthermore we study concavity of these games

In this paper we introduce the class of simple combinatorial optimisation cost games, which are games associated to {0, 1}-matrices. A coalitional value of a combinatorial optimisation game is determined by solving an integer program associated with this matrix and the characteristic vector of...