No Access

AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES

F. R. McMORRIS

Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA

Department of Mathematics, University of Louisville, Louisville, KY 40292, USA

Search for more papers by this author

HENRY MARTYN MULDER

Econometrisch Instituut, Erasmus Universiteit, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands

Search for more papers by this author

, and

OSCAR ORTEGA

Department of Mathematics, Harold Washington College, Chicago, IL 60601, USA

Search for more papers by this author

https://doi.org/10.1142/S1793830910000681Cited by:18 (Source: Crossref)

Abstract

A mean of a sequence π = (x₁, x₂, …, x_k) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean (π) = {x|x is a mean of π} is called the mean function on X. In this note, the mean function on finite trees is characterized axiomatically.

Keywords:

AMSC: 05-XX, 91-XX

References

K. J. Arrow , A. K. Sen and K. Suzumura (eds.) , Handbook of Social Choice and Welfare 1 ( North Holland , Amsterdam , 2002 ) . Google Scholar
K. J. Arrow , A. K. Sen and K. Suzumura (eds.) , Handbook of Social Choice and Welfare 2 ( North Holland , Amsterdam , 2005 ) . Google Scholar
J. P. Barthélemy and M. F. Janowitz, SIAM J. Discr. Math. 4, 305 (1991). Crossref, Google Scholar
J. P. Barthélemy and B. Monjardet, Math. Soc. Sci. 1, 235 (1981). Crossref, Google Scholar
J. E. Biagi, Facility location and the mean function, MA Thesis, University of Louisville, 2000 . Google Scholar
W. H. E. Day and F. R. McMorris , Axiomatic consensus theory in group choice and biomathematics , Front. Appl. Math. ( SIAM , Philadelphia , 2003 ) . Crossref, Google Scholar
D. P. Foster and R. Vohra, Oper. Res. 46, 347 (1998), DOI: 10.1287/opre.46.3.347. Crossref, Google Scholar
R. Holzman, Math. Oper. Res. 15, 553 (1990), DOI: 10.1287/moor.15.3.553. Crossref, Google Scholar
F. R. McMorris, H. M. Mulder and R. C. Powers, Discr. Appl. Math. 127, 319 (2003), DOI: 10.1016/S0166-218X(02)00213-5. Crossref, Google Scholar
F. R. McMorris, H. M. Mulder and F. S. Roberts, Discr. Appl. Math. 84, 165 (1998), DOI: 10.1016/S0166-218X(98)00003-1. Crossref, Google Scholar
F. R. McMorris, F. S. Roberts and C. Wang, Networks 38, 84 (2001), DOI: 10.1002/net.1027. Crossref, Google Scholar
P. B. Mirchandani and R. L. Francis (eds.) , Discrete Location Theory ( Wiley , New York , 1990 ) . Google Scholar
H. M. Mulder, K. B. Reid and M. Pelsmajer, Australasian J. Combinatorics 41, 223 (2008). Google Scholar
R. Vohra, European J. Oper. Res. 90, 78 (1996), DOI: 10.1016/0377-2217(94)00330-0. Crossref, Google Scholar