An axiomatic characterization of a class of locations in tree networks
成果类型：
Article
署名作者：
Foster, DP; Vohra, RV
署名单位：
University of Pennsylvania; University System of Ohio; Ohio State University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.46.3.347
发表日期：
1998
页码：
347-354
关键词：
摘要：
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.