Minimum cost spanning tree problems connect agents efficiently to a source when agents are located at different points …

if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games … minimum cost spanning tree game with revenues has a non-empty core. Furthermore, we provide an example of a minimum cost … spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium …

We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity over cost and …

game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if … every connection cost can take only two values (low or high cost), then, the corresponding minimum cost spanning tree game … with revenues has a non-empty core. Furthermore, we provide an example of a minimum cost spanning tree game with revenues …

We s tudy minimum cost spanning tree problems for a given set of users connected to a source. We propose a rule of …

This paper discusses minimum cost spanning tree games and argues that the standard approach of using a transferable …