Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes

Abstract

An antimedian of a profile $\\pi = (x_1, x_2, \\ldots , x_k)$ of vertices of a graph $G$ is a vertex maximizing the sum of the distances to the elements of the profile. The antimedian function is defined on the set of all profiles on $G$ and has as output the set of antimedians of a profile. It is a typical location function for finding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes