Showing 1 - 3 of 3
The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which...
Persistent link: https://www.econbiz.de/10005450899
the median function, which minimizes the sum of the distances to the client locations, three simple and natural axioms …, anonymity, betweenness, and consistency suffice on tree networks (continuous case) as shown by Vohra, and on cube-free median … graphs (discrete case) as shown by McMorris et.al.. In the latter paper, in the case of arbitrary median graphs, a fourth …
Persistent link: https://www.econbiz.de/10008484078
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average … client prefers the facility (with a + sign) or rejects it (with a - sign). The graphs for which all median sets, or all … Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed …
Persistent link: https://www.econbiz.de/10009351529