We define the canonical form of a cost spanning tree problem. The canonical form has the property that reducing the cost of any arc, the minimal cost of connecting agents to the source is also reduced. We argue that the canonical form is a relevant concept in this kind of problems and study a...

In this paper we study the restriction, to the class of bargaining problems with coalition structure, of several values which have been proposed on the class of non-transferable utility games with coalition structure. We prove that all of them coincide with the solution independently studied in...

We associate an optimistic coalitional game with each minimum cost spanning tree problem. We define the worth of a coalition as the cost of connection assuming that the rest of the agents are already connected. We define a cost sharing rule as the Shapley value of this optimistic game. We prove...

In this paper we characterize the set of rules satisfying additivity on the estate along with additivity on the estate and the claims in bankruptcy problems and other related problems. Moreover, new characterizations of the well known rules based on the principles of "equal award", "equal loss",...

We characterize a rule in cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity. In...

We introduce a new value for NTU games with coalition structure. This value coincides with the consistent value for trivial coalition structures, and with the Owen value for TU games with coalition structure. Furthermore, we present two characterizations: the first one using a consistency...

We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions. The equilibrium payoff can them be easily adapted to the framework of Steiner trees.

We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.