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...

The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations. The P-value is related to the Kruskal algorithm for finding an mcst. Moreover, the P-value leads to a core allocation of...

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...

This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend classical solutions from the theory of minimum cost spanning tree games. We study the properties of such solutions and...