Cooperative aspects of multiple criteria decision making with respect to cost allocation in a network will be studied.The vector valued costs of a graph that connects a group of geographically scattered users to a common source have to be distributed among the users.Here a specific class of cost...

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 su cient condition for the balancedness of all three games.Furthermore we study concavity of these games.

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces...

A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for...

We consider a situation in which a group of banks consider connecting their Automated TellerMachines (ATMs) in a network, so that the banks customers may use ATMs of any bank in the network.The problem studied is that of allocating the total transaction costs arising in the network, among the...

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems (see Bird 1976) where an existing network has to be extended to connect users to a source. In this paper, we present two cost allocation rules for these problems, viz. the proportional rule and...

Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing...

The special class of conservative charge systems for minimum cost spanning tree (mcst) situations is introduced.These conservative charge systems lead to single-valued rules for mcst situations, which can also be described with the aid of obligation functions and are, consequently, cost...

In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as...