In this paper we describe four axioms that uniquely characterize the c
lass of locations in tree networks that are obtained by minimizing an
additively separable, nonnegative, nondecreasing, differentiable, and
strictly convex function of distances. This result is analogous to res
ults that have been obtained in the theory of bargaining, social choic
e, and fair resource allocation.