The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.

The PERT (Program Evaluation Review Technique) is a operational research tool used to schedule and coordinate activities in a complex project. We present two values for measuring the importance of each activity. Both values are obtained through an axiomatic characterization using three...

In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to the source and dividing the cost among them. The basic idea is very simple: we ask each agent the part of the cost he is willing to pay for an arc to be constructed. We prove...

The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with single-peaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. The literature has implicitly...

Tijs et al. (2006) introduce the family of obligation rules in minimum cost spanning tree problems. We prove that obligation rules are closely related with the marginalistic values of the irreducible game. We also provide axiomatic characterizations of obligation rules with two basic...

We characterize a rule in minimum 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.