We introduce a family of sequential contributions rules for minimum cost spanning tree problems. Each member of the family assigns an agent part of the cost of connecting him to his immediate predecessor, and all of his followers are equally responsible for the remaining part. We characterize...