An Axiomatic Characterization of a Class of Locations in Tree Networks

Dean P. Foster and Rakesh V. Vohra
Additional contact information
Dean P. Foster: University of Pennsylvania, Philadelphia, Pennsylvania
Rakesh V. Vohra: Ohio State University, Columbus, Ohio

Operations Research, 1998, vol. 46, issue 3, 347-354

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.

Keywords: Facilities; location; discrete (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.46.3.347 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:46:y:1998:i:3:p:347-354

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().