Kannan, Balakrishnan; Manoj, Changat; Henry, Martyn Mulder(Econometric Institute Research Papers, October 1, 2007)
[+]
[-]
Abstract:
Following the Majority Strategy in graphs, other consensus strategies, namely
Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on
graphs are discussed as methods for the computation of median sets of pro¯les. A
review of algorithms for median computation on median graphs is discussed and
their time complexities are compared. Implementation of the consensus strategies
on median computation in arbitrary graphs is discussed
Description:
Report/Econometric Institute, Erasmus University Rotterdam,EI 2007-34
Kannan, Balakrishnan; Manoj, Changat; Henry, Martyn Mulder(Econometric Institute Research Papers, September 15, 2006)
[+]
[-]
Abstract:
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 this Plurality
Strategy always finds the set of all medians are precisely those for which the
set of medians induces always a connected subgraph
Description:
Report/Econometric Institute, Erasmus University Rotterdam