An axiomatic characterization of a class of locations in tree networks

An axiomatic characterization of a class of locations in tree networks

0.00 Avg rating0 Votes
Article ID: iaor19991554
Country: United States
Volume: 46
Issue: 3
Start Page Number: 347
End Page Number: 354
Publication Date: May 1998
Journal: Operations Research
Authors: ,
Keywords: location
Abstract:

In this paper we describe four axioms that uniquely characterize the class 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 results that have been obtained in the theory of bargaining, social choice, and fair resource allocation.

Reviews

Required fields are marked *. Your email address will not be published.